![](https://img-blog.csdn.net/20180824151036797?watermark/2/text/aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1plb2xpbQ==/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70)
//#pragma GCC optimize(2)
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <vector>
#include <fstream>
#include <list>
#include <iomanip>
#include <numeric>
using namespace std;
typedef long long ll;
const int MAXN = 1e6 + 10;
bool isprime[MAXN + 100];
int prime[MAXN + 100], tf = 0;
void init()
{
for(int i = 2; i < MAXN; i++)
{
if(!isprime[i])
prime[tf++] = i;
for(int j = 0; j < MAXN && i * prime[j] < MAXN; j++)
{
isprime[i * prime[j]] = 1;
if(i * prime[j] == 0)
break;
}
}
/*for(int i = 0; i < 100; i++)
cout<<prime[i]<<endl;*/
}
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0); cout.tie(0);
init();
int N, M, ans = 0;
cin>>N>>M;
bool flag = false;
for(int i = 2; i <= N - M; i++)
{
if(!isprime[i] && !isprime[i + M])
{
flag = true;
cout<<i<<' '<<i + M<<endl;
}
}
flag ? cout<<endl : cout<<"empty"<<endl;
return 0;
}