program treasure;
Var
th:array[1..10000,1..100]of longint;
tl:array[1..10000,1..100]of 0..1;
xx:array[1..10000]of longint;
n,m,i,j,sum,k:longint;
procedure shang(x,y:longint);
var
a:longint;
begin
if(x=n+1)then exit;
a:=th[x,y];
sum:=(sum+a)mod 20123;
for j:=1 to m do
begin
th[x,j]:=th[x,j] mod xx[x];
if(th[x,j]=0)then th[x,j]:=xx[x];
end;
a:=th[x,y];
while(a<>0)do
begin
if(tl[x,y]=1)then dec(a);
if(a=0)then break;
inc(y);
if(y>m)then y:=y mod m;
end;
shang(x+1,y);
end;
Begin
fillchar(xx,sizeof(xx),0);
readln(n,m);
sum:=0;
for i:=1 to n do
begin
for j:=1 to m do
begin
read(tl[i,j],th[i,j]);
if(tl[i,j]=1)then inc(xx[i]);
end;
end;
read(k);
inc(k);
shang(1,k);
writeln(sum);
End.