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.*;

public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        long[] a = new long[m];
        long[] d = new long[m];
        int[] g = new int[n];
        HashMap<Long,Integer> b = new HashMap<Long, Integer>();
        HashMap<Long, String> c  = new HashMap<Long, String>();

        for (int i=0;i<m;i++){
            int p = scan.nextInt();
            long y = scan.nextLong();
            b.put(y,p);
            a[i] = y;
            d[i] = y;
        }

        Arrays.sort(a);

        for (int j=0;j<m;j++){
            int p1 = b.get(a[j]);
            int p2 = g[p1-1]+1;
            g[p1-1] += 1;
            String a1 = "";
            String a2 = p1+"";
            String a3 = p2+"";
            for (int k1=0;k1<6-a2.length();k1++){
                a1 += "0";
            }
            a1 += a2;
            for (int k2=0;k2<6-a3.length();k2++){
                a1 += "0";
            }
            a1 += a3;
            c.put(a[j], a1);
        }

        for (int q = 0 ; q<m;q++){
            System.out.println(c.get(d[q]));
        }
    }
}