package LinearDataStructures.Lab_StartSeriously_21dec;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Collections;

public class e09_MathPotato {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] names = reader.readLine().split(" ");
        int num = Integer.parseInt(reader.readLine());


        ArrayDeque<String> children = new ArrayDeque<>();
        Collections.addAll(children, names);
        int cycle = 1;
        while (children.size() > 1) {
            for (int i = 1; i < num; i++) {
                children.offer(children.poll());
            }
            if (isPrimeNumber(cycle)) {
                System.out.println("Prime " + children.peek());
            } else {
                System.out.println("Removed " + children.poll());
            }
            cycle++;
        }


        System.out.println("Last is " + children.poll());

    }

    public static boolean isPrimeNumber(int i) {
        int factors = 0;
        int j = 1;

        while (j <= i) {
            if (i % j == 0) {
                factors++;
            }
            j++;
        }
        return (factors == 2);
    }
}