#include<bits/stdc++.h>
using namespace std;
bool l[200][20000];
int k[200][20000],m,n,q,i,j,h,s,t;
int main()
{
	cin >> n >> m;
	for(i = 0;i < n;++i)
		for(j = 0;j < m;++j)
			scanf("%d%d",&l[i][j],&k[i][j]);
	scanf("%d",&q);
	i = 0,t = j = q; 
	while(i <= n)
	{
		s %= 20123;
		s += k[i][t];
		h = 0;
		while(h != k[i][t])
		{
			if(l[i][j])++h;
			++j,j %= m;
		}
		++i;
		if(j == 0)j = m - 1;
		else --j;
		t = j;
	}
	printf("%d",s);
}

没优化，7个点RE，求救