#include <cstdio>

#include <iostream>

#define N 10001

#define M 101

int n, m, s, t, len, ans;

int a[N][M], pos[N];

bool b[N][M];

inline int read()

{

	int x = 0, f = 1;

	char ch = getchar();

	for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -1;

	for(; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';

	return x * f;

}

int main()

{

	int i, j;

	n = read();

	m = read();

	for(i = 1; i <= n; i++)

		for(j = 0; j < m; j++)

			b[i][j] = read(), a[i][j] = read();

	s = read();

	for(i = 1; i <= n; i++)

	{

		len = 0;

		ans = (ans + a[i][s]) % 20123;

		t = s;

		do

		{

			if(b[i][t]) pos[len++] = t;

			t = t + 1 == m ? 0 : t + 1;

		}

		while(t ^ s);

		s = pos[(a[i][s] - 1) % len];

	}

	printf("%d\n", ans);

	return 0;

}