import java.io.*;
import java.util.Set;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
String[] a=bf.readLine().split(" ");
int m = Integer.parseInt(a[0]);
int n = Integer.parseInt(a[1]);
int s = Integer.parseInt(a[2]);
String array[] = new String[m];
Set<String> ar = new TreeSet<String>();
for (int i = 0; i < m; i++) {
array[i] = bf.readLine();
}
for (int i = s - 1; i < m; i += n) {
if (ar.add(array[i])) {
System.out.println(array[i]);
} else {
while (!ar.add(array[i])) {
i += 1;
if (i == m) return;
}
System.out.println(array[i]);
}
}
if (ar.isEmpty()) {
System.out.println("Keep going...");
return;
}
}
}
PAT_B_1069_Java(20分)
猜你喜欢
转载自blog.csdn.net/qq_43511405/article/details/107427031
今日推荐
周排行