import java.util.Scanner;
public class sushu
{
public static boolean isPrime(int i)
{
boolean isPrime = true;
for( int k=2; k<i; k++)
{
if( i % k==0)
{
isPrime = false;
break;
}
}
return isPrime;
}
public static void main(String[] args)
{
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int m = in.nextInt();
int n = in.nextInt();
int cnt = 0;
int sum = 0;
if( m == 1)
{
m = 2;
}
for(int i=m; m<n; i++)
{
if( isPrime(i))
{
cnt ++;
sum += i;
}
}
System.out.println(cnt+" "+sum);
}
}
public class sushu
{
public static boolean isPrime(int i)
{
boolean isPrime = true;
for( int k=2; k<i; k++)
{
if( i % k==0)
{
isPrime = false;
break;
}
}
return isPrime;
}
public static void main(String[] args)
{
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int m = in.nextInt();
int n = in.nextInt();
int cnt = 0;
int sum = 0;
if( m == 1)
{
m = 2;
}
for(int i=m; m<n; i++)
{
if( isPrime(i))
{
cnt ++;
sum += i;
}
}
System.out.println(cnt+" "+sum);
}
}