var

f,tf:array[0..10000] of longint;

a1,a2,v1,n,c1:longint;

v,c:array[1..10000] of longint;

function min(b1,b2:longint):longint;

begin

if b1>b2 then min:=b2 else min:=b1;

end;

begin

readln(v1,n,c1);

tf[0]:=1;

for a1:=1 to v1 do f[a1]:=999999999;

for a1:=1 to n do readln(v[a1],c[a1]);

for a1:=1 to n do

for a2:=v1 downto 0 do

if (tf[a2]=1)and(a2+v[a1]c1 then writeln('Impossible') else writeln(c1-f[v1]);

end.

只对了一个点，总是比答案高。