#include <iostream>
#include <fstream>
using namespace std;
const int MAXP = 1101;
int nprime; //质数个数
int prime[300]={1}; //质数表
void Init()
{
bool flag[MAXP+1] = {0};
nprime=1;
for (int i = 2;i*i<=MAXP;i++)
if (!flag[i])
for (int j=i*i;j<=MAXP;j+=i)
flag[j] = 1;
for (int i =2;i<=MAXP;i++)
if (!flag[i])
{
prime[nprime++] = i;
}
}
int main()
{
int N;
int C;
int i=0;
int temp =0;
int temp2 =0;
Init();
while (cin>>N>>C)
{
i =0;
temp = 2*C;
while (prime[i]<N)
i++;
temp2 = i;
if (temp>=temp2)
{
cout<<N<<" "<<C<<":";
for (int j =0;prime[j]<=N;j++)
cout<<" "<<prime[j];
cout<<"/n"<<endl;
}
else
{
if (!(temp2%2))
{
temp = (temp2 - 2*C)/2;
cout<<N<<" "<<C<<":";
for (int j =temp;j<temp+2*C;j++ )
cout<<" "<<prime[j];
cout<<"/n"<<endl;
}
else
{
temp = (temp2 - 2*C +1)/2;
cout<<N<<" "<<C<<":";
for (int j =temp;j<temp+2*C -1;j++ )
cout<<" "<<prime[j];
cout<<"/n"<<endl;
}
}
}
return 0;
}