1.2.5

/*
ID:18861501
LANG:C++
TASK:dualpal
*/
/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
/*---------------------Work-----------------------*/
int s[1000];
bool is_hui(int cnt)
{
for(int i=1;i<=cnt/2;i++)
if(s[i]!=s[cnt-i+1]) return false;
return true;
}
void work()
{
int N,S;
scanf("%d%d",&N,&S);
int numcount=0;
for(int num=S+1;;num++)
{
int count=0;
for(int base=2;base<=10;base++)
{
int cnt=1,n=num;
while(n)
{
s[cnt++]=n%base;
n=n/base;
}
cnt--;
if(is_hui(cnt)) count++;
if(count==2)
{
numcount++;
printf("%d\n",num);
break;
}
}
if(numcount==N) break;
}
}
/*------------------Main Function------------------*/
int main()
{
//freopen("test.txt","r",stdin);
freopen("dualpal.out","w",stdout);
freopen("dualpal.in","r",stdin);
work();
return 0;
}