// "Brute force" approach to tabulate pi(N) 
//  Pi(N) =  the number of prime numbers less than or equal to N 

import java.io.*;

class primes {

  public static void main (String[] args) throws IOException {

    int n, i, limit, step, pi = 0;
    boolean prime;

    BufferedReader stdin;
    stdin = new BufferedReader (new InputStreamReader (System.in));

    System.out.print ("Enter the limit: ");
    limit = Integer.parseInt (stdin.readLine());

    System.out.print ("Enter the step: ");
    step = Integer.parseInt (stdin.readLine());

    for (n=2; n<limit; n++) {
      prime = true;
      for (i=2; (i<=n/3) & prime; i++) if (n%i==0) prime = false;
      if (prime) pi++;
      if (n%step==0) System.out.println(n + "\t" + pi);
    }
  }
}