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

public class Main
{
    private static class Item
            implements Comparable {
        int prefecture;
        int year;
        int order;

        Item(int prefecture, int year)
        {
            this.prefecture = prefecture;
            this.year = year;
        }

        @Override
        public int compareTo(Object o)
        {
            return year - ((Item)o).year;
        }
    }

    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        Map<Integer, List<Item>> map = new HashMap<>(n);
        List<Item> list = new ArrayList<>(m);

        for (int i = 0; i < m; i++) {
            int p = scanner.nextInt();
            int y = scanner.nextInt();
            if (!map.containsKey(p)) {
                map.put(p, new ArrayList<>());
            }
            List<Item> itemList = map.get(p);
            Item item = new Item(p, y);
            itemList.add(item);
            list.add(item);
        }

        for (List<Item> xs : map.values()) {
            Collections.sort(xs);
            for (int i = 0; i < xs.size(); i++) {
                xs.get(i).order = i;
            }
        }

        for (Item yp : list) {
            System.out.println(String.format("%06d%06d", yp.prefecture, yp.order + 1));
        }
    }
}
