var a:array[1..20000]of longint;
i,j,k,l,m,n,s,r:longint; f:text;
procedure sort(l,r:longint);
var i,j,x,y:longint;
begin
i:=l;
j:=r;
x:=a[(i+j)div 2];
repeat
while a[i]<x do inc(i);
while x<a[j] do dec(j);
if i<=j then begin
y:=a[i];
a[i]:=a[j];
a[j]:=y;
inc(i);
dec(j);
end;
until i>j;
if i<r then sort(i,r);
if l<j then sort(l,j);
end;
begin
assign(f,’123.txt’);reset(f);
read(f,n);read(f,m);
for i:=1 to n do read(f,a[i]);
sort(1,n);
for i:=1 to n do begin if a[i]=m then j:=i;end;
s:=a[j-1]+a[j+1];
if s=1 or 0 then begin writeln(s);write(’F’);exit;end;
if s=2 then begin writeln(s);write(’Y’); exit;end;
m:=0;l:=2;
repeat
r:=s mod l;
if r=0 then m:=1;
inc(l);
until(l>s-1)or(m=1);
if m=1 then begin writeln(s);
writeln(’F’); exit; end;
writeln(s);write(’F’);
end.