又是回文串模拟。。。。
好像无坑 、、、
/*
ID: rowanha3
LANG: C++
TASK: dualpal
*/
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int num[10000];
int fan(int b,int a)
{int len,i;len=0;while(a){num[len++]=a%b;a=a/b;}for(i=0;i<=len/2;i++){if(num[i]!=num[len-1-i])return 0;}return 1;
}
int dos(int a)
{int i;int leap;leap=0;for(i=2;i<=10;i++){if(fan(i,a))leap++;}if(leap>=2)return 1;return 0;
}
int main()
{freopen("dualpal.in","r",stdin);freopen("dualpal.out","w",stdout);int s,n,i;cin>>s>>n;for(i=n+1;s;i++){if(dos(i)){cout<<i<<endl;s--;}}fclose(stdin);fclose(stdout);return 0;
}