#include <bits/stdc++.h>
using namespace std;
#define mod 20123
int n, m, start, ans;
struct node {
	int data;
	bool flag;
} room[10005][105];
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> room[i][j - 1].flag;
			scanf("%d", &room[i][j - 1].data);
		}
	}
	scanf("%d", &start);
	for (int i = 1; i <= n; i++) {
		ans = (ans+room[i][start].data)%mod;
		if (room[i][start].flag == 1) {
			continue;
		}
		int now = start;
		while (room[i][start].data > 0) {
			now = (now + 1 < m) ? now + 1 : 0;
			if (room[i][now].flag == 1) {
				room[i][start].data--;
			}
		}
		start = now;
	}
	printf("%d", ans);
}