var i, nr, n, p: longint;

function euclid(x, y: longint): longint;
var r: longint;
begin
     repeat
           r:=x mod y;
           x:=y;
           y:=r;
     until r=0;
     euclid:=x;
end;
begin
     assign(input, 'frac.in');
     reset(input);
     readln(n, p);
     i:=0;
     nr:=0;
     while (i<=n) and (nr<p) do begin
           inc(i);
           if euclid(n, i)=1 then
              inc(nr)
     end;
     assign(output, 'frac.out');
     rewrite(output);
     write(i);
end.