uses crt, sysutils, math;

function check(x: Integer): Boolean;
var
  i: Integer;
begin
  if x < 2 then
    Exit(False);
  for i := 2 to Trunc(Sqrt(x)) do
    if x mod i = 0 then
      Exit(False);
  Exit(True);
end;

function loaibo(N: String): String;
var
  i, j: Integer;
  kq: String;
  t: Boolean;
begin
  kq := '';
  for i := 1 to Length(N) do
  begin
    t := False;
    for j := 1 to Length(kq) do
      if N[i] = kq[j] then
      begin
        t := True;
        Break;
      end;
    if not t then
      kq := kq + N[i];
  end;
  Exit(kq);
end;

procedure nhonhat(N: String; Q: Integer);
var
  g: array of Integer;
  i, j, temp: Integer;
  t: String;
begin
  t := '';
  for i := 1 to Length(N) do
    if N[i] in ['0'..'9'] then
      t := t + N[i];

  SetLength(g, Length(g));
  for i := 1 to Length(t) do
    g[i-1] := StrToInt(t[i]);

  for i := 0 to High(g) - 1 do
    for j := i + 1 to High(g) do
      if g[i] > g[j] then
      begin
        temp := g[i];
        g[i] := g[j];
        g[j] := temp;
      end;

  if Q <= Length(g) then
  begin
    Write(g[Q-1], ' ');
    if check(g[Q-1]) then
      WriteLn('Yes')
    else
      WriteLn('No');
  end
  else
    WriteLn('-1');
end;

var
  N, KetQua: String;
  Q: Integer;

begin
  clrscr;
  ReadLn(N);
  ReadLn(Q);
  
  KetQua := loaibo(N);
  nhonhat(KetQua, Q);
  
  ReadLn;
end.

uses crt;
function ok(n:integer):boolean;
var i:integer;
begin
if (n<=1) then
ok:=false
else if (n<=3) then
ok:=true
else if (n mod 2=0) or (n mod 3=0) then
ok:=false
else
begin
i:=5;
while (i*i<=n) do
begin
if (n mod i=0) or (n mod (i+2)=0) then
begin
ok:=false;
exit;
end;
i:=i+6;
end;
ok:=true;
end;
end;
var
s:string;
n:int64;
q,d:integer;
q2:char;
ktra:boolean;
begin
clrscr;
readln(s);
readln(q);
val(s,n,d);
ktra:=false;
q2:=' ';
for d:=0 to length(s)-1 do
begin
if d=q then
begin
q2:=s[d+1];
ktra:=true;
break;
end;
end;
if ktra then
begin
write(q2);
d:=ord(q2)-ord('0');
if ok(d) then
writeLn(' Yes')
else
writeLn(' No');
end
else
begin
writeLn(' -1');
end;
readln;
end.