#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define mod 20123

 #define maxn 10010

 #define maxm 110

 using namespace std;

 inline int read()

 {

     int x=;

     bool f=;

     char c=getchar();

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

     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

     if(f) return x;

     return -x;

 }

 inline void write(int x)

 {

     if(x<){putchar('-');x=-x;}

     if(x>)write(x/);

     putchar(x%+'');

 }

 int n,m,st,ans;

 int map[maxn][maxm],map_s[maxn][maxm],num[maxn];

 int main()

 {

 //    freopen("treasure.in","r",stdin);

 //    freopen("treasure.out","w",stdout);

     n=read();m=read();

     int cnt=,c=;

     for(int i=;i<=n*m;i++)

     {

         int x,y;

         x=read();y=read();

         map_s[c][cnt]=x;

         if(x==)num[c]++;

         map[c][cnt]=y;

         if(cnt==m-)

         {

             cnt=;

             c++;

         }

         else cnt++;

     }

     st=read();

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

     {

         if(map_s[i][st]==)

         {

             int xb=map[i][st];

             xb%=num[i];

             if(xb==)xb+=num[i];

             ans+=map[i][st];

             ans%=mod;

             while(xb>)

             {

                 if(st==m-)st=;

                 else st++;

                 if(map_s[i][st]==)xb--;

             }

         }

         else if(map_s[i][st]==)

         {

             int xb=map[i][st]-;

             xb%=num[i];

             if(xb==)xb+=num[i];

             ans+=map[i][st];

             ans%=mod;

             while(xb>)

             {

                 if(st==m-)st=;

                 else st++;

                 if(map_s[i][st]==)xb--;

             }

         }

     }

     write(ans);

     return ;

 }