program magic_tree;
var t, i : longint;
    p,b : longint;
    fin,fout:text;
begin
  assign(fin,'fructe.in'); reset(fin);
  assign(fout,'fructe.out'); rewrite(fout);
  readln(fin, t);
  for i := 1 to t do
    begin
      readln(fin,p,b);
      p:=0;
      if b mod 2 =0 then
        writeln (fout,0)
        else writeln(fout,1);
    end;
  close(fout);
  close(fin);
end.