#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
int n,m,q;
ll solve(ll n,ll a,ll b,ll c){
    ll m=((__int128_t)a*n+b)/c;
    if(!a)return (n+1)*(b/c);
    if(a>=c||b>=c)return n*(n+1)/2*(a/c)+(n+1)*(b/c)+solve(n,a%c,b%c,c);
    return n*m-solve(m-1,c,c-b-1,a);
}
ll cal(ll a,ll b){
    ll l=0,r=m-1;
    while(l<r){
        ll mid=(l+r+1)>>1;
        if(a*mid/b<=n-1)l=mid;
        else r=mid-1;
    }
    return solve(l,a,0,b)+(m-1-l)*(n-1);
}
void solve(ll a,ll b,ll c,ll d,ll pos){
    ll x=a+c;
    ll y=b+d;
    if(x>=n||y>=m){
        ll rk=cal(c,d);
        ll cnt=min((n-1)/c,(m-1)/d);
        pos-=rk-cnt;
        cout<<pos*c+1<<" "<<pos*d+1<<"\n";
        return;
    }
//    cout<<x<<" "<<y<<" "<<cal(x,y)<<" "<<pos<<"\n";
    if(cal(x,y)>=pos){
        ll l=1,r=1e6;
        while(l<r){
            ll mid=(l+r+1)>>1;
            if(cal(a*mid+c,b*mid+d)>=pos)l=mid;
            else r=mid-1;
        }
        solve(a,b,c+l*a,d+r*b,pos);
    }
    else{
        ll l=1,r=1e6;
        while(l<r){
            ll mid=(l+r+1)>>1;
            if(cal(a+c*mid,b+d*mid)<pos)l=mid;
            else r=mid-1;
        }
        solve(a+c*l,b+d*l,c,d,pos);
    }
}
signed main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n>>m>>q;
    while(q--){
        ll pos;cin>>pos;
        if(pos<=m-1)cout<<1<<" "<<pos+1<<"\n";
        else if(pos>1ll*n*m-n)cout<<1+pos-1ll*n*m+n<<" "<<1<<"\n";
        else solve(0,1,1,0,pos-(m-1));
    }
    return 0;
}