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 JavaScript (node.js v5.12) (judge verdict: Runtime Error)

"use strict";

function binarySearch(ar, el, compare_fn = (a,b) => a-b) {
  var m = 0;
  var n = ar.length - 1;
  while (m <= n) {
      var k = (n + m) >> 1;
      var cmp = compare_fn(el, ar[k]);
      if (cmp > 0) {
          m = k + 1;
      } else if(cmp < 0) {
          n = k - 1;
      } else {
          return k;
      }
  }
  return -m - 1;
}

function main(input) {
  const inputs = input.split("\n").filter(x => x !== "");

  const N = Number(inputs[0].split(" ")[0]);
  const M = Number(inputs[0].split(" ")[1]);
  
  const P = [];
  const Y = [];
  const ID = [];

  for (let i = 0; i < M; i++) {
    const inputLine = inputs[1+i].split(" ");
    const Pi = inputLine[0];
    const Yi = inputLine[1];
    P.push(Pi);
    Y.push(Yi);
  }

  const mapArr = {};

  for (let i = 0; i < P.length; i++) {
    if (mapArr[P[i]]) {
      mapArr[P[i]].push(Y[i]);
    } else {
      mapArr[P[i]] = [Y[i]];
    }
  }

  for (let Pi in mapArr) {
    mapArr[Pi] = mapArr[Pi].sort((a,b) => a - b);
  }

  let result = "";
  for (let i = 0; i < P.length; i++) {
    let firstHalf = "" + P[i];
    while (firstHalf.length < 6) {
      firstHalf = "0" + firstHalf;
    }

    let secondHalf = "" + (binarySearch(mapArr[P[i]], Y[i]) + 1);
    while (secondHalf.length < 6) {
      secondHalf = "0" + secondHalf;
    }

    result = result + firstHalf + secondHalf + "\n";
  }

  console.log(result);
}

main(require("fs").readFileSync("/dev/stdin", "utf8"));