pat1015 Reversible Primes

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<cstring>
#include<cmath>
#include<map>
#include<stack>
#define N 10005
#define ll long long
using namespace std;
int ok(int x)
{
	if(x == 1)return 0;
	for(int i = 2;i*i<=x;i++)
		if(x%i == 0)return 0;
	return 1;
}
int main()
{
	int n,m,d,i,j,tn;
	while(scanf("%d",&n)!=EOF)
	{
		if(n<0)break;
		tn = n;
		scanf("%d",&d);
		m = 0;
		string s = "";
		while(tn)
		{
			s+=tn%d+'0';
			tn/=d;
		}
		for(i = 0;i<s.length();i++)
		{
			m*=d;
			m+=s[i]-'0';
		}
		if(ok(n)&&ok(m))printf("Yes\n");
		else printf("No\n");
	}
    return 0;
}