#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<cstdlib>

#include<vector>

using namespace std;

const int MAXN = ;

typedef long long LL;

inline int rd(){

    int x=,f=;char ch=getchar();

    while(!isdigit(ch)) {f=ch=='-'?:;ch=getchar();}

    while(isdigit(ch))  {x=(x<<)+(x<<)+ch-'';ch=getchar();}

    return f?x:-x;

}

vector<LL> g[MAXN];

int n,m,q,Max,num,rt[MAXN];

LL pos;

int sum[MAXN<<],ls[MAXN<<],rs[MAXN<<];

LL query(int x,int l,int r,int k){

    if(l==r) return l;

    int mid=l+r>>,sizl=mid-l+-sum[ls[x]];

    if(sizl>=k) return query(ls[x],l,mid,k);

    else return query(rs[x],mid+,r,k-sizl);

}

void modify(int &x,int l,int r){

    if(!x){

        x=++num;

        ls[x]=rs[x]=;

    }

    sum[x]++;

    if(l<r){

        int mid=l+r>>;

        if(mid>=pos) modify(ls[x],l,mid);

        else modify(rs[x],mid+,r);

    }

}

LL Del_r(int x,LL now){

    pos=query(rt[n+],,Max,x);

    modify(rt[n+],,Max);

    LL ret=pos<=n?1ll*pos*m:g[n+][pos-n-];

    g[n+].push_back(now?now:ret);

    return ret;

}

LL Del_l(int x,int y){

    pos=query(rt[x],,Max,y);modify(rt[x],,Max);

    LL ret=pos<m?1ll*(x-)*m+pos:g[x][pos-m];

    g[x].push_back(Del_r(x,ret));

    return ret;

}

int main(){

    n=rd(),m=rd(),q=rd();Max=max(n,m)+q;

    int x,y;

    while(q--){

        x=rd(),y=rd();

        if(y==m) printf("%lld\n",Del_r(x,));

        else printf("%lld\n",Del_l(x,y));

    }

    return ;

}