**Input**

The input begins with the number t of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.

**Output**

For every test case print all prime numbers p such that m <= p <= n, one number per line, test cases separated by an empty line.

----------

{Code written by Hacker4life May the code be with you} program zad; var t,a,b,i,j,k:integer; q:boolean; begin read(t); for j:=1 to t do begin read(a,<img src='http://cdn.codecall.net/public/style_emoticons/<#EMO_DIR#>/cool.png' class='bbc_emoticon' alt='B)' />; for i:=a to b do begin q:=true; k:=1; if i>1 then begin repeat k:=k+1; if i mod k=0 then q:=false; until (k=i-1)or(q=false); if i=2 then writeln(2) else if q then writeln(i); end; end; writeln; end; end.some suggestions?