#include<bits/stdc++.h>

#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define ll long long
#define pb push_back
using namespace std;

const int N=1e6+5;
vector<ll> x(N);
vector<ll> uzeo(N);
int n,m;
ll t;
pair<int,int> ans;
void solve(int i,int j){
    x[i]=x[i-1]+j-1;
    uzeo[i]=j-1;
    //printf("%i %i: %lld %i %i %lld\n",i,j,x[i],n,m,t);
    ll posle=m/j;
    ll j2=posle*j;
    ll ostalo=m-j2;
    int b=lower_bound(x.begin(),x.begin()+i,ostalo+1)-x.begin()-1;
    ll redova=min((ll)n,posle*i+b);
    //printf("%lld %lld  %lld %i\n",redova,posle,ostalo,b);
    ll k=redova/i;
    ll sm=(ll)redova*m;
    sm-=x[i]*k;
    sm-=k*(k-1)/2*j*i;
    ll ost=redova%i;
    //printf("%lld: %lld %lld\n",sm,ost*(m-j*k),x[ost]);
    sm-=ost*(j*k);
    sm-=x[ost];
    //printf("%lld!\n",sm);
    if(sm<t){
        solve(i+1,j);
        return;
    }
    int imam=min((n+1)/i,(m+1)/j);
    ll over=sm-t;
    if(over<=imam-1){
        int ind=imam-over;
        ans={i*ind,j*ind};
        return;
    }
    solve(i,j+1);
}
pair<int,int> solve(ll tt){
    t=tt;
    if(t<=m){
        return {0,t};
    }
    t-=m;
    ll kraj=n*(ll)(m+1)-t;
    if(kraj<n){
        return {n-kraj,0};
    }
    solve(1,1);
    return ans;
}
void stres(){
    for(n=0;n<=10;n++){
        for(m=0;m<=10;m++){
            printf("%i %i:\n",n,m);
            for(ll t=1;t<(n+1)*(m+1);t++){
                pair<int,int> a=solve(t);
                printf("%i %i\n",a.f+1,a.s+1);
            }
        }
    }
}
int main(){
    //stres();
    int q;
    scanf("%i %i %i",&n,&m,&q);
    n--;m--;
    for(int i=0;i<q;i++){
        ll tt;
        scanf("%lld",&tt);
        pair<int,int> a=solve(tt);
        printf("%i %i\n",a.f+1,a.s+1);
    }
}