#include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + ;

int n, m, Q, N_;

int size[N * ], lson[N * ], rson[N * ];

int root[N], jdjs;

int ins[N];

int now_root;

#define LL long long

LL val[N * ];

LL Ans1;

#define gc getchar()

inline int read() {

    int x = ; char c = gc;

    while(c < '' || c > '') c = gc;

    while(c >= '' && c <= '') x = x *  + c - '', c = gc;

    return x;

}

int Calc_size(int l, int r) {

    if(now_root != n + ) {

        if(r <= m - ) return r - l + ;

        else {

            if(l <= m - ) return (m - ) - l + ;

            else return ;

        }

    } else {

        if(r <= n) return r - l + ;

        else {

            if(l <= n) return n - l + ;

            else return ;

        }

    }

}

void Sec_A(int l, int r, int & jd, int x) {

    if(!jd) {

        jd = ++ jdjs;

        size[jd] = Calc_size(l, r);

        if(l == r) {

            if(now_root <= n) val[jd] = (LL) 1ll * (now_root - ) * m + l;

            else val[jd] = (LL) 1ll * l * m;

        }

    }

    size[jd] --;

    if(l == r) {Ans1 = val[jd]; return ;}

    int mid = (l + r) >> ;

    if((!lson[jd] && x <= mid - l + ) || x <= size[lson[jd]]) Sec_A(l, mid, lson[jd], x);

    else {

        if(!lson[jd]) x -= (mid - l + );

        else x -= size[lson[jd]];

        Sec_A(mid + , r, rson[jd], x);

    }

}

void Ins(int l, int r, int & jd, int whe, LL Num) {

    if(!jd) {

        jd = ++ jdjs;

        size[jd] = Calc_size(l, r);

        if(l == r) val[jd] = Num;

    }

    size[jd] ++;

    if(l == r) return ;

    int mid = (l + r) >> ;

    if(whe <= mid) Ins(l, mid, lson[jd], whe, Num);

    else Ins(mid + , r, rson[jd], whe, Num);

}

int main() {

    n = read(), m = read(), Q = read();

    N_ = max(n, m) + Q;

    while(Q --) {

        int x = read(), y = read();

        if(y == m) now_root = n + , Sec_A(, N_, root[now_root],x);

        else now_root = x, Sec_A(, N_, root[now_root], y);

        cout << Ans1 << endl;

        now_root = n + ; Ins(, N_, root[n + ], n + (++ ins[n + ]), Ans1);

        if(y != m) {

            now_root = n + ; Sec_A(, N_, root[now_root], x);

            now_root = x; Ins(, N_, root[x], m -  + (++ ins[x]), Ans1);

        }

    }

    return ;

}