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 Rust (1.15.1) (judge verdict: Time Limit Exceeded)

use std::collections::*;

#[allow(unused_macros)]
macro_rules! get {
    ([$t:ty] ; $n:expr) => {
        (0..$n)
        .map(|_| get!([$t])).collect::<Vec<_>>()
    };
    ($($t:ty),+ ; $n:expr) => {
        (0..$n).map(|_| get!($($t),+)).collect::<Vec<_>>()
    };
    ([$t:ty]) => {
        rl().split_whitespace()
        .map(|x| x.parse().unwrap())
        .collect::<Vec<$t>>()
    };
    ($t:ty) => {
        rl().parse::<$t>().unwrap()
    };
    ($($t:ty),*) => {
        {
            let line =rl();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap()),*)
        }
    };
}
fn rl() -> String {
    let mut line = String::new();
    std::io::stdin().read_line(&mut line).unwrap();
    line.trim().to_string()
}

fn f(a: usize, b: usize) -> String {
    let sa = format!("{:06}", a);
    let sb = format!("{:06}", b);
    return sa + &sb;
}

fn main() {
    let (_pref, city) = get!(usize, usize);
    let mut v = Vec::with_capacity(city);
    let mut order = Vec::with_capacity(city);
    for _ in 0..city {
        let mut tmp = get!(usize, usize);
        v.push(tmp);
        order.push(tmp.1);
    }
    v.sort_by(|x, y| x.1.cmp(&y.1));
    let mut ans = vec!["a".to_string(); city];
    let mut map = HashMap::new();
    for i in 0..city {
        match map.get(&v[i].0) {
            Some(n) => {
                let s = f(v[i].0, *n as usize + 1);
                let pos = order
                    .iter()
                    .enumerate()
                    .find(|&x| *x.1 == v[i].1)
                    .unwrap()
                    .0;
                ans[pos] = s;
            }
            None => {
                let s = f(v[i].0, 1);
                let pos = order
                    .iter()
                    .enumerate()
                    .find(|&x| *x.1 == v[i].1)
                    .unwrap()
                    .0;
                ans[pos] = s;
            }
        }
        let counter = map.entry(v[i].0).or_insert(0);
        *counter += 1;
    }
    //eprintln!("{:?}", map);
    for i in 0..ans.len() {
        println!("{}", ans[i]);
    }
}