#include<bits/stdc++.h>
using namespace std;
const int mod=20123;
int n,m,a[10005][250],s,h=1,v[10005][250],ans,f[10005];
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=0;j<m;j++){
			cin>>v[i][j]>>a[i][j];
			if(v[i][j]==1) f[i]++;
		}
	}
	cin>>s;
	while(h<=n){
		int x=a[h][s]%f[h],i=s;
		ans=(ans+a[h][s])%mod;
		while(x>0){
			if(i>=m) i=0;
			if(v[h][i]==1) x--;
			i++;
		}
		s=i-1;h++;
	}
	cout<<ans<<endl;
	return 0;
}