RT

#include <bits/stdc++.h>
#define endl '\n'
#define ll long long

using namespace std;

const int N = 10010, M = 110, mod = 20123;
int n,m,a[N][M],num[N][M];
vector<int> v[N];

int solve(int x,int y,int sum)
{
	if (x == n)
		return (sum + num[x][y]) % mod;
	int p;
	for (int i = 0;i < (int)v[x].size();i++)
		if (v[x][i] >= y)
		{
			p = i;
			break;
		}
	p = (p + num[x][y] - 1) % (int)(v[x].size());
	return solve(x + 1,v[x][p],(sum + num[x][y]) % mod);
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	
//	freopen("P1076_2.in","r",stdin);
	
	cin >> n >> m;
	for (int i = 1;i <= n;i++)
		for (int j = 0;j < m;j++)
		{
			cin >> a[i][j] >> num[i][j];
			if (a[i][j] == 1)
				v[i].push_back(j);
		}
	int st; cin >> st;
	cout << solve(1,st,0) << endl;
	
	return 0;
}