noip宝藏_寻宝官方网

#include<bits/stdc++.h>
using namespace std;
const int N=10005;
const int M=105;
int Floor[N][M];
int value[N][M];
int f[N];

int main()
{
    int n,m;
    scanf("%d%d",&n,&m);                   
    for(int i=0;i<n;++i)
        for(int j=0;j<m;++j){
            scanf("%d%d",&Floor[i][j],&value[i][j]);
            f[i]+=Floor[i][j];
    }
    int num,ans=0;
    scanf("%d",&num);
    for(int i=0;i<n;++i)
    {
        ans = (ans+value[i][num])%20123;
        int len = value[i][num] % f[i];
        if(len==0)len = f[i];
        while(len){
            len-=Floor[i][num];
            if(len==0)break;
            num = (num+1)%m;
        }
    }
    printf("%d\n",ans);
    return 0;
}