AT_coder abc213_c

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N],b[N],c[N],d[N],h,w,n;
int main(){
	cin>>h>>w>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
		c[i]=a[i];
		d[i]=b[i];
	}
	sort(c+1,c+1+n);//排序 
	int n1=unique(c+1,c+1+n)-c-1;//去重 
	sort(d+1,d+1+n);
	int n2=unique(d+1,d+1+n)-d-1;
	for(int i=1;i<=n;i++){
		int nx=lower_bound(c+1,c+1+n1,a[i])-c;
		int ny=lower_bound(d+1,d+1+n2,b[i])-d;
		cout<<nx<<" "<<ny<<"\n";
	}
	return 0;
}