In Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.

City i is established in year Y_i and belongs to Prefecture P_i.

You can assume that there are no multiple cities that are established in the same year.

It is decided to allocate a 12-digit ID number to each city.

If City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.

Here, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.

Find the ID numbers for all the cities.

Note that there can be a prefecture with no cities.

Constraints

* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq P_i \leq N
* 1 \leq Y_i \leq 10^9
* Y_i are all different.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N M
P_1 Y_1
:
P_M Y_M


Output

Print the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).

Examples

Input

2 3
1 32
2 63
1 12


Output

000001000002
000002000001
000001000001


Input

2 3
2 55
2 77
2 99


Output

000002000001
000002000002
000002000003
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+10;
int N,M;
int P[MAXN],Y[MAXN];
map<int,vector<int> > A;
map<int,int> Rank;
int main()
{
	scanf("%d%d",&N,&M); 
	for(int i=1;i<=M;i++)
	{
		scanf("%d%d",P+i,Y+i);
		A[P[i]].push_back(Y[i]);
	}
	for(map<int,vector<int> >::iterator it=A.begin();it!=A.end();it++)
	{
		sort(it->second.begin(),it->second.end());
		for(int i=0;i<it->second.size();i++) Rank[it->second[i]]=i+1;
	}
	for(int i=1;i<=M;i++) printf("%06d%06d\n",P[i],Rank[Y[i]]);
	return 0;
}