Query K-means Clustering and the Double Dixie Cup Problem