#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;
const int maxn = 2e5 + 5;
struct Info{
    int mn, mx, lmn;
}tr[maxn * 4];
int a[maxn];

int query(int u, int l, int r, int mx){
    if (tr[u].mx <= mx) return l + mx;
    if (l == r){
        return tr[u].mn;
    }
    int mid = (l + r) / 2;
    if (mx <= tr[2 * u + 1].mx){
        return min(tr[u].lmn, query(2 * u + 1, mid + 1, r, mx));
    }
    return min(mid + 1 + mx, query(2 * u, l, mid, mx));
}

void pushup(int u, int l, int r){
    int mid = (l + r) / 2;
    tr[u].lmn = query(2 * u, l, mid, tr[2 * u + 1].mx);
    tr[u].mn = min(tr[u].lmn, tr[2 * u + 1].mn);
    tr[u].mx = max(tr[2 * u].mx, tr[2 * u + 1].mx);
}

void build(int u, int l, int r){
    if (l == r){
        tr[u].mn = a[r];
        tr[u].mx = a[r] - r;
        return;
    }
    int mid = (l + r) / 2;
    build(2 * u, l, mid);
    build(2 * u + 1, mid + 1, r);
    pushup(u, l, r);
}

void modify(int u, int l, int r, int x, int v){
    if (l == r){
        tr[u].mn = v;
        tr[u].mx = v - r;
        return;
    }
    int mid = (l + r) / 2;
    if (x <= mid) modify(2 * u, l, mid, x, v);
    else modify(2 * u + 1, mid + 1, r, x, v);
    pushup(u, l, r);
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, m, t;
    cin >> n >> m >> t;
    for(int i = 1; i <= n; i++){
        int x;
        cin >> x;
        a[i] = a[i + n] = x;
    }
    build(1, 1, 2 * n);
    int lastans = 0;
    cout << (lastans = tr[1].lmn + n - 1) << '\n';
    while(m--){
        int x, y;
        cin >> x >> y;
        if (t) x ^= lastans, y ^= lastans;
        modify(1, 1, 2 * n, x, y);
        modify(1, 1, 2 * n, x + n, y);
        cout << (lastans = tr[1].lmn + n - 1) << '\n';
    }
    
}