#include<bits/stdc++.h>
using namespace std;
int n,m,k,l[100005],r[100005],a[100005],b[100005],f[1005][1005],t[1005];
void dfs(int st,int x){
    f[st][++t[st]]=a[x];
    if (f[st][t[st]]!=st){
        dfs(st,a[x]);
    }
}
int main(){
    freopen("usaco_Feb_swap.in","r",stdin);
    freopen("usaco_Feb_swap.out","w",stdout);
    scanf("%d%d%d",&n,&m,&k);
    for (int i=1;i<=n;i++){
        a[i]=i;
        b[i]=i;
        f[i][0]=i;
    }
    for (int i=1;i<=m;i++){
        scanf("%d%d",&l[i],&r[i]);
        for (int j=l[i];j<=(l[i]+r[i])/2;j++){
            swap(a[j],a[l[i]+r[i]-j]);
        }
    }
    for (int i=1;i<=n;i++){
        dfs(i,i);
    }
    for (int i=1;i<=n;i++){
        //cout<<t[i]<<" "<<k<<endl;
        int tmp=k%(t[i]);
        cout<<f[i][tmp]<<endl;
    }
    return 0;
}