AlgorithmsI PA2: Randomized Queues and Deques Subset

import edu.princeton.cs.algs4.StdIn;
import edu.princeton.cs.algs4.StdOut;

public class Subset {
public static void main(String[] args){
int k = Integer.parseInt(args[0]);

RandomizedQueue<String> queue = new RandomizedQueue<String>();

while(StdIn.hasNextLine() && !StdIn.isEmpty()) {
if(queue.size() < k) {
queue.enqueue(StdIn.readString());
}else {
break;
}
}

for(int i = 0; i< k; i++) {
StdOut.println(queue.dequeue());
}
}
}