Problem:
Score: 300 points

Problem Statement

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, ...).

Sample Input 1

2 3
1 32
2 63
1 12

Sample Output 1

000001000002
000002000001
000001000001

As City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.

As City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.

As City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.

Sample Input 2

2 3
2 55
2 77
2 99

Sample Output 2

000002000001
000002000002
000002000003

Solution in Java (OpenJDK 11.0.6) (judge verdict: Time Limit Exceeded)


import java.util.AbstractMap;
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 {

	static Scanner scanner;
	static long[][] dp;
    static int ind=1;
	public static void main(String[] args) {
	    scanner = new Scanner(System.in);

	    int n=gi();
	    int m=gi();
	    long[] P=new long[m];
	    long[] Y=new long[m];
        List<Pair<Long, Long>> l=new ArrayList<Pair<Long, Long>>();
        List<Pair<Long, Long>> l2=new ArrayList<Pair<Long, Long>>();
        Map<Long, Long> map=new HashMap<Long, Long>();
        Map<Pair<Long, Long>, String> maps=new HashMap<Pair<Long, Long>, String>();

        for (int i=0; i< m;i++) {
        	P[i]=gl();
        	Y[i]=gl();
        	Pair<Long, Long> pair= new Pair<Long, Long>(P[i], Y[i]);
        	l.add(pair);
        	l2.add(pair);
        }

        Collections.sort(l);

        for(Pair<Long, Long> p : l) {
        	long key = p.getKey();
        	if(!map.containsKey(key)) {
        		map.put(key, 1l);
        	} else {
        		long v=map.get(key);
        		map.put(key, v+1);
        	}
        	String s= String.format("%06d", key) +String.format("%06d", map.get(key));
        	maps.put(p, s);

        }
        
        for(Pair<Long, Long> p :l2) {
        	System.out.println(maps.get(p));
        }

        //System.out.println(max);
	}

	public static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> implements Comparable<Pair<K, V>> {
		/** serialVersionUID. */
	    private static final long serialVersionUID = 6411527075103472113L;

	    public Pair(final K key, final V value) {
	        super(key, value);
	    }
	    
	    @Override
	    public boolean equals(Object o) {
	    	Comparable key = (Comparable)this.getKey();
			Comparable key2 = (Comparable)((Pair)o).getKey();
			Comparable v = (Comparable)this.getValue();
			Comparable v2 = (Comparable)((Pair)o).getValue();
			
			return key.equals(key) && v.equals(v2);
	    }

//		@Override
//		public int compareTo(Pair<K, V> o) {
//
//			Comparable key = (Comparable)this.getKey();
//			Comparable key2 = (Comparable)o.getKey();
//
//			return key.compareTo(key2);
//		}

		@Override
		public int compareTo(Pair<K, V> o) {

			Comparable key = (Comparable)this.getValue();
			Comparable key2 = (Comparable)o.getValue();

			return key.compareTo(key2);
		}
	}

	// 文字列として入力を取得
	public static String gs() {
		return scanner.next();
	}

	// intとして入力を取得
	public static int gi() {
		return Integer.parseInt(scanner.next());
	}

	// longとして入力を取得
	public static long gl() {
		return Long.parseLong(scanner.next());
	}

	// doubleとして入力を取得
	public static double gd() {
		return Double.parseDouble(scanner.next());
	}
}