{
ID:klipada1
LANG:PASCAL
PROB:dualpal
}
var s,k,i,laba,j,n,a,b,jok:longint;
    lj,strin:string;
    abdul:boolean;
procedure baza1(s:longint);
begin
  abdul:=true;
  str(s,lj);
  jok:=length(lj);
  for j:=1 to (jok div 2) do
    if lj[j]=lj[jok-j+1]
      then continue
      else begin abdul:=false; break; end;

  if abdul
    then k:=k+1;
  abdul:=true;
end;

procedure baza2(s,m:longint);
begin
  abdul:=true;
  while s>0 do
    begin
      strin:=strin+chr((s mod m)+48);
      s:=s div m;
    end;
  jok:=length(strin);

  for j:=1 to jok div 2 do
    if strin[j]=strin[jok-j+1]
      then continue
      else begin abdul:=false; break; end;

  if abdul
    then k:=k+1;
  strin:='';
end;


begin
  assign(input,'dualpal.in');   reset(input);
  assign(output,'dualpal.out'); rewrite(output);
  readln (a,b);
  i:=b;
  while n<a do
    begin
      i:=i+1;
      baza1(i);
      for laba:=2 to 9 do
        baza2(i,laba);
      if k>1
        then begin n:=n+1; writeln(i); end;
      k:=0;
    end;
  close(input);
  close(output);
end.