import java.util.ArrayList;
import java.util.Scanner;

public class Subprime 
{	
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		
		int l = sc.nextInt();
		int h = sc.nextInt();
		String substr = sc.next();
		int count = 0;
		
		ArrayList<Integer> prime = new ArrayList<>();
		prime.add(2);
		
		int num = 3;
		
		while (prime.size() < h) {
			boolean isPrime = true;
			
			int i = 0;
			int check = prime.get(i);
			
			while (check < Math.sqrt(num)) {
				if (num % check == 0) {
					isPrime = false;
					break;
				}
				i++;
				check = prime.get(i);
			}
			
			if (isPrime == true) {
				prime.add(num);
			}
			
			num += 2;
		}
		
		for (int i = l - 1 ; i < prime.size() ; i++) {
			int temp = prime.get(i);
			String pstr = Integer.toString(temp);
			
			if (pstr.contains(substr)) {
				System.out.println(i + " " + pstr);
				count++;
			}
		}
		
		sc.close();
		System.out.println(count);
	}
}