#include <bits/stdc++.h>
#define mod int(1e9+7)
using namespace std;
void Sieve(bool prime[],int n)
{
memset(prime,true,n);
int sqrtn = sqrt(n);
for (int i = 3;i <= sqrtn;i++)
if (prime[i] == true)
for (int j = i;j <= n/i;j++)
prime[i*j] = false;
}
int sum(int n){
int t = 0;
for (;n != 0;) t += n%10, n /= 10;
return t;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int x,k;
cin >> x >> k;
bool prime[x+1];
Sieve(prime,x);
if (k == 2) cout << 2 << ' ';
for (int i = 3;i <= x;i += 2)
if (prime[i])
if (sum(i) == k)
cout << i << ' ';
}
