#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 10;
int prime[N] , cnt , mark[N];
bool ji(int x){
    if(x <= 1) return false;
    for(int i = 2 ; i < x ; i++){
    if(x % i == 0) return false;
    }
return true;
}
void is_prime(int n){
    for(int i = 2 ; i <= n ; i++){
        if(!mark[i]){
        prime[cnt ++] = i;
        for(int j = i + i ; j <= n ; j += i) mark[j] = 1;
        }
    }
}
void get_prime(int n){
    for(int i = 2 ; i <= n ; i ++){
        if(!mark[i]) prime[cnt ++] = i;
        for(int j = 0 ; prime[j] <= n / i ; j ++) {
            mark[prime[j] * i] = 1;
            if(i % prime[j] == 0) break;
        }
    }
}
/*int _quick(int x){
	while(x){
		if(x & 1) ans = (ans * a) % p;
		a = (1ll * a * a) % p;
		 
	}
}*/
int main(){
	int n , k;
	cin >> n >> k;
	int flag = 0;
	for(int i = 2 ; i <= n ; i ++){
		n = i , k = i + k;
		if(ji(n) == 1 && ji (k) == 1){
			cout << n << " " << k <<endl;
			flag = 1;
		}
	}
	if(flag == 0){
		cout<<"empty"<<endl;
	}
	return 0;
}