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
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		int []P = new int[M];
		int []Y = new int[M];
		for(int i = 0; i < M; i++) {
			P[i] = sc.nextInt();
			Y[i] = sc.nextInt();
		}
		sc.close();

		Data []d = new Data[M];
		for(int i = 0; i < M; i++) {
			d[i] = new Data(i + 1, Y[i], P[i]);
		}
		Map<Integer, List<Data>> map = new HashMap<Integer, List<Data>>();
		for(int i = 0; i < M; i++) {
			if(map.containsKey(d[i].p)) {
				map.get(d[i].p).add(d[i]);
			}else {
				List<Data> list = new ArrayList<Data>();
				list.add(d[i]);
				map.put(d[i].p, list);
			}
		}
		for(int key : map.keySet()) {
			List<Data> list = map.get(key);
			Collections.sort(list, new MyComparator());
			int cnt = 1;
			for(Data t : list) {
				String s1 = String.format("%06d", t.p);
				String s2 = String.format("%06d", cnt);
				cnt++;
				t.n = s1 + s2;
			}
		}
		for(Data t : d) {
			System.out.println(t.n);
		}
	}
	static class Data{
		int id, y, p;
		String n;
		public Data(int id, int y, int p) {
			this.id = id;
			this.y = y;
			this.p = p;
		}
	}
	 static class MyComparator implements Comparator<Data>{
		 @Override
        public int compare(Data d1, Data d2) {
			 if(d1.y > d2.y) {
				 return 1;
			 }else if(d1.y < d2.y) {
				 return -1;
			 }else {
				 return 0;
			 }
		 }
	 }

}