Snakes And Ladders

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<20)
int N,M,Q,p[MX],A[MX],g[101],a,b,I;
int main(void){
    IN(tt)F(tt){
        scanf("%d%d%d",&N,&M,&Q);
        fill(p,p+N,1),CL(g,-1),I=0;
        F(M)scanf("%d%d",&a,&b),g[a]=b;
        ga(Q,A);
        F(Q){
            p[I]=min(p[I]+A[i],100);
            if(~g[p[I]])p[I]=g[p[I]];
            if(p[I]>=100)break;
            ++I,I%=N;
        }
        F(N)printf("Position of player %d is %d.\n",i+1,p[i]);
    }
    return 0;
}