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 (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    N, M = R()
    PY = [R() for _ in range(M)]
    PYs = sorted(PY, key=itemgetter(1,0))
    setp = set()
    pl = [[] for _ in range(N+1)]
    done = [0] * (N+1)
    for p, y in PYs:
        pl[p].append(y)
        setp.add(p)
    
    plist = list(setp)
    for p, y in PY:
        if not done[p]:
            done[p] = 1
            pl[p].sort
        print('{0:0=6}{1:0=6}'.format(p,bisect_right(pl[p], y)))
    

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline
import bisect

N_ken,M_si = map(int,input().split())
ken_year_map = {}
for i in range(1,N_ken+1):ken_year_map[i]=[]

ken_list = [0]*M_si
year_list = [0]*M_si

for si in range(M_si):
    ken_list[si],year_list[si] = map(int,input().split())
    ken_year_map[ken_list[si]] += [year_list[si]]
        
for i in ken_year_map:
    ken_year_map[i].sort()

for ken,year in zip(ken_list,year_list):
    print('{:06}{:06}'.format(ken,bisect.bisect_right(ken_year_map[ken], year)))

Solution (Python):
from collections import defaultdict
N, M = map(int, input().split())
l = []
for i in range(M):
  p, y = map(int, input().split())
  l.append((y, p, i))

l.sort()
d = defaultdict(int)

c = []
for y, p, i in l:
  d[p] += 1
  c.append((i, str(p).zfill(6) + str(d[p]).zfill(6)))
  
c.sort()
for i, x in c:
  print(x)

Solution (Python):
N, M = map(int, input().split())

Cs = []
for i in range(M):
    P, Y = map(int, input().split())
    Cs.append((P, Y, i))
Cs.sort()
Cs[0] = (Cs[0][2], Cs[0][0], 1)
for i in range(1, M):
    if Cs[i][0] == Cs[i - 1][1]:
        Cs[i] = (Cs[i][2], Cs[i][0], Cs[i - 1][2] + 1)
    else:
        Cs[i] = (Cs[i][2], Cs[i][0], 1)
Cs.sort()

for C in Cs:
    print("{:06}{:06}".format(C[1], C[2]))

Solution (Python):

a,b=map(int,input().split())
c=[list(map(int,input().split())) for i in range(b)]
d=[[]for i in range(a+1)]
for i,k in enumerate(c):
  d[k[0]].append([i,k[1]])
  
e=[[]for i in range(b)]  
for i in range(a+1):
  d[i]=sorted(d[i], key=lambda x: x[1])
  for j,k in enumerate(d[i]):
    e[k[0]]=[i,j+1]
    
for i in range(b):
  print(str(e[i][0]).zfill(6)+str(e[i][1]).zfill(6))

Solution (Python):
import sys
imput=sys.stdin.readline
a,b=map(int,input().split())
c=[list(map(int,input().split())) for i in range(b)]
d=[[]for i in range(a+1)]
for i,k in enumerate(c):
  d[k[0]].append([i,k[1]])
  
e=[[]for i in range(b)]  
for i in range(a+1):
  d[i]=sorted(d[i], key=lambda x: x[1])
  for j,k in enumerate(d[i]):
    e[k[0]]=[i,j+1]
    
for i in range(b):
  print(str(e[i][0]).zfill(6)+str(e[i][1]).zfill(6))

Solution (Python):
n, m = map(int, input().split())
cnt = {}
y_p = {}
ans = [1 for i in range(n)]
y_ = []

for i in range(m):
  p, y = map(int, input().split())
  y_.append(y)
  cnt[i] = [p, y]
  y_p[y] = p
y_.sort()

for i in y_:
  p = y_p[i]
  y_p[i] = ans[p-1]
  ans[p-1] += 1

for i in range(m):
  p = cnt[i][0]
  y = cnt[i][1]
  print(str(p*1000000 + y_p[y]).zfill(12))

Solution (Python):
from heapq import heappush, heappop
N, M = map(int, input().split())
dic = {i:[] for i in range(1,N+1)}
ans = [0]*M
for i in range(M):
  p, y = map(int, input().split())
  heappush(dic[p], (y,i))

for k in dic.keys():
  count = 1
  p = str(k)
  while len(p)<6:
    p = '0'+p
  while dic[k]:
    y, i = heappop(dic[k])
    a = str(count)
    while len(a)<6:
      a = '0'+a
    ans[i] = p+a
    count += 1
for a in ans:
  print(a)

Solution (Python):
from heapq import heappush, heappop
N, M = map(int, input().split())
dic = {i:[] for i in range(1,N+1)}
ans = [0]*M
for i in range(M):
  p, y = map(int, input().split())
  heappush(dic[p], (y,i))

for k in dic.keys():
  count = 1
  p = str(k)
  while len(p)<6:
    p = '0'+p
  while dic[k]:
    y, i = heappop(dic[k])
    a = str(count)
    while len(a)<6:
      a = '0'+a
    ans[i] = p+a
    count += 1
for a in ans:
  print(a)

Solution (Python):
N, M = map(int, input().split())
base = []
for i in range(M):
  (a, b) = map(int, input().split())
  base.append((a, b, i))
sorted_target = sorted(base) 

prefecture_index = sorted_target[0][0]

i=0
result = {}

for target in sorted_target:
  if prefecture_index == target[0]:
    i+=1
  else:
    prefecture_index = target[0]
    i = 1
  result[target[2]] = [prefecture_index, i]

for i in range(M):
  print("{:0=6}{:0=6}".format(result[i][0], result[i][1]))

Solution (Python):
N, M = map(int, input().split())
base = []
for i in range(M):
  (a, b) = map(int, input().split())
  base.append((a, b, i))
sorted_target = sorted(base) 

prefecture_index = sorted_target[0][0]

i=0
result = {}

for target in sorted_target:
  if prefecture_index == target[0]:
    i+=1
  else:
    prefecture_index = target[0]
    i = 1
  result[target[2]] = [prefecture_index, i]

for i in range(M):
  print("{:0=6}{:0=6}".format(result[i][0], result[i][1]))

Solution (Python):
import bisect
N, M = map(int, input().split())
py_list = [list(map(int, input().split())) for i in range(M)]

pref_city_map = {}

for i in range(N+1):
    pref_city_map[i] = []

for py in py_list:
    p = py[0]
    pref_city_map[p].append(py[1])

for k in pref_city_map.keys():
    pref_city_map[k].sort()

for py in py_list:
    p = py[0]
    y = py[1]
    p_str = str(p).zfill(6)
    idx = bisect.bisect(pref_city_map[p], y)
    idx_str  = str(idx).zfill(6)
    print(p_str + idx_str)

Solution (Python):
import sys
n,m = map(int,input().split())
py = []
d = dict()

for i in range(m):
    (a,b) = map(int,input().split())
    py.append((a,b))
sort_py = sorted(py)

tmp_p = sort_py[0][0]
cnt = 1
for p,y in sort_py:
    if p == tmp_p:
        d[(p,y)] = cnt
    else:
        tmp_p = p
        cnt = 1
        d[(p,y)] = cnt
    cnt += 1

for i in range(m):
    print('{0}{1}'.format(str(py[i][0]).zfill(6), str(d[py[i]]).zfill(6)))

Solution (Python):
from itertools import groupby

n, m = map(int, input().split())
ipy = [[i] + list(map(int, input().split())) + [0] for i in range(m)]

ipy.sort(key=lambda x: (x[1], x[2]))

cnt = 1
for itr, v in enumerate(ipy):
  if itr > 0:
    if ipy[itr - 1][1] != ipy[itr][1]:
      cnt = 1 
  p = str(v[1]).zfill(6) + str(cnt).zfill(6)
  ipy[itr][3] = p
  cnt += 1

ipy.sort(key=lambda x: (x[0]))

for i in ipy:
  print(i[3])

Solution (Python):
import sys


		
def main():
	m, n = map(int, input().split())
	
	ll=[[] for _ in range(m+1)]
	lll=[]
	for ii in range(n):
		pi, yi = map(int, input().split())
		a=(ii,pi,yi)
		ll[pi].append(a)
		lll.append(a)
	
	for mm in ll:
		mm.sort(key=lambda x:x[2])
		
		for i, v in enumerate(mm):
			tmp = v[1]*1000000+(i+1)
			ofs='0'*(12-len(str(tmp)))
			lll[v[0]] = ofs + str(tmp)
			
	for iii in lll:
		print(iii)
	


if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

n,m=MI() 
ids=[0]*m
pids=[1]*(1+n)
prefs=[]
for i in range(m):
    p,y=MI()
    prefs+=[(y,i,p)]
prefs.sort(key=lambda x:x[0])

for y,i,p in prefs:
    c=pids[p]
    pid='0'*(6-len(str(p)))+str(p)
    cid='0'*(6-len(str(c)))+str(c)
    ids[i]=pid+cid
    pids[p]+=1
    
for iid in ids:
    print(iid)

Solution (Python):
N,M = map(int,input().split())
city_list = sorted([[list(map(int,input().split())),i] for i in range(M)])
ID = city_list[0][0]
num = 0
ans = []
for i in range(M):
  if ID != city_list[i][0][0]:
    ID = city_list[i][0][0]
    num = 0
  num += 1
  ans.append([city_list[i][1],'{0:06d}'.format(ID)+'{0:06d}'.format(num)])
ans = sorted(ans)
for i in range(len(ans)):
  print(ans[i][1])

Solution (Python):
N, M = map(int,input().split())
ls = []
for m in range(M):
    p, y = map(int,input().split())
    ls.append([p,y])
sorted_ls = sorted(ls,key=lambda x:x[1])
counter = [0 for i in range(N+1)]
d = {}
for p,y in sorted_ls:
    counter[p]+=1
    num = counter[p]
    d[y] = num
for p,y in ls:
    
    print (str(p).zfill(6)+str(d[y]).zfill(6))

Solution (Python):
n,m=map(int,input().split())
s = []
for i in range(m):
    pref,year=map(int,input().split())
    s.append([pref,year,i])
s.sort()
rank = 1
for i in range(m):
    if s[i][0] != s[i-1][0]:
        rank = 1
    s[i][1]=rank
    rank += 1
s.sort(key=lambda x: x[2]) 
for i in range(m):
    print("0"*(6-len(str(s[i][0])))+str(s[i][0])+"0"*(6-len(str(s[i][1])))+str(s[i][1]))

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

n,m=MI()
ids=[0]*m
pref=[[] for i in range(1+n)]
for i in range(m):
    p,y=MI()
    pref[p]+=[(i,y)]
for p in range(1,n+1):
    ls=pref[p]
    ls.sort(key=lambda x:x[1])
    c=1
    for i,y in ls:
        pid='0'*(6-len(str(p)))+str(p)
        cid='0'*(6-len(str(c)))+str(c)
        c+=1
        ids[i]=pid+cid
        
for iid in ids:
    print(iid)

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

n,m=MI()
pref=[]
for i in range(m):
    p,y=MI()
    pref+=[(p,i,y)]
pref.sort(key=lambda x:x[0]*10**10+x[2])
c=0
pre=pref[0][0]
ans=[]
for p,i,y in pref:
    pid='0'*(6-len(str(p)))+str(p)
    if pre==p:
        c+=1
        cid='0'*(6-len(str(c)))+str(c)
    else:
        c=1
        cid='0'*(6-len(str(c)))+str(c)
    ans+=[(i,pid+cid)]
    pre=p
ans.sort(key=lambda x:x[0])
for i,iid in ans:
    print(iid)

Solution (Python):
N, M = map(int, input().split())
data = [list(map(int, input().split())) + [i] for i in range(M)]
data.sort(key=lambda x: [x[0], [x[1]]])

res = [None] * M
prev_n = data[0][0]
m_count = 1
for d in data:
    n, m, idx = d
    if prev_n != n:
        prev_n = n
        m_count = 1
    res[idx] = str(prev_n).zfill(6) + str(m_count).zfill(6)
    m_count += 1
    
print(*res, sep='\n')

Solution (Python):
from operator import itemgetter


n, m = map(int, input().split())
p = [0] * m
y = [0] * m

d = {}

for i in range(m):
    p[i], y[i] = map(int, input().split())

    if not p[i] in d:
        d[p[i]] = []

    d[p[i]].append([y[i], i])

for v in d.values():
    v.sort(key=itemgetter(0))

ans = [None] * m

for k, v in d.items():
    for i, vv in enumerate(v):
        ans[vv[1]] = str(k).zfill(6) + str(i + 1).zfill(6)

print("\n".join(ans))

Solution (Python):
n, m = map(int, input().split())

prefectures = [[] for _ in range(n)]
for i in range(m):
    p, y = map(int, input().split())
    prefectures[p-1].append((y, i))

ans = [None] * m
for i, p in enumerate(prefectures):
    p.sort()
    for j, (y, k) in enumerate(p):
        ans[k] = "%06d%06d" % (i+1, j+1)

print(*ans, sep='\n')

Solution (Python):
N, M = map(int, input().split())
py = sorted([list(map(int, input().split()))+[i] for i in range(M)], key=lambda x:x[1])
count = [1] * N
ans = [None] * M

for i in range(M):
  p, y, num = py[i]
  ans[num] = "{:0>6}{:0>6}".format(p, count[p-1])
  count[p-1] += 1

for i in range(M):
  print(ans[i])

Solution (Python):
n, m = map(int, input().split())

prefectures = []
for i in range(m):
    p, y = map(int, input().split())
    prefectures.append({'i': i, 'p': p, 'y': y})

prefectures.sort(key=lambda x: (x['p'], x['y']))

ans = []
cnt = 1
for i in range(len(prefectures)):
    if i != 0:
        if prefectures[i-1]['p'] == prefectures[i]['p']:
            cnt += 1
        else:
            cnt = 1
    s = str(prefectures[i]['p']).zfill(6)+str(cnt).zfill(6)
    ans.append({'i': prefectures[i]['i'], 'p': s})


ans.sort(key=lambda x: x['i'])

for x in ans:
    print(x['p'])

Solution (Python):
import bisect

N,M=map(int,input().split())
p=[[0] for _ in range(M)]
y=[[0] for _ in range(M)]
d={}
for i in range(1,N+1):d[i]=[]
for i in range(M):
    p[i],y[i]=map(int,input().split())
    d[p[i]] +=[y[i]]

for i in d:
    d[i].sort()

for i,j in zip(p,y):
    print('{:06}{:06}'.format(i,bisect.bisect_right(d[i], j)))

Solution (Python):
N,M = map(int,input().split())
li = [list(map(int,input().split()))+[i+1] for i in range(M)] +[[N+1]] 
ans = [0]*M
li.sort()
index = cnt = 0
for i in range(1,M+1):
    if li[i-1][0]!=li[i][0]:
        tmp = li[index:i]
        tmp.sort(key=lambda x: x[1])
        index = i
        for j in range(len(tmp)):
            ans[cnt] = [str(tmp[j][0]).zfill(6)+str(j+1).zfill(6),tmp[j][2]]
            cnt+=1

ans.sort(key=lambda x: x[1])

for i in range(M):
    print(ans[i][0])

Solution (Python):
n,m = map(int,input().split())
py = [list(map(int,input().split())) +[i] for i in range(m)]
py.sort(key=lambda x: [x[0], x[1]])
ans_list = [0]*m
tmp = py[0][0]
cnt = 0
for p,y,idx in py:
    if tmp == p:
        cnt +=1
    else:
        cnt = 1
        tmp = p
    ans_list[idx] = format(p ,'06') + format(cnt, '06')

for ans in ans_list:
  print(ans)

Solution (Python):
n, m = (int(i) for i in input().split())
py = [[int(i) for i in input().split()] for j in range(m)]
pre = {}
for i in range(m):
    cur_p = py[i][0]
    cur_p_cities = pre.get(cur_p,[])
    cur_p_cities.append(i)
    pre[cur_p] = cur_p_cities

for i in pre.keys():
    pre[i].sort(key=lambda x:py[x][1])
    city_order = tuple(range(1,len(pre[i])+1))
    pre[i] = dict(zip(pre[i],city_order))

city_nums = []
for i in range(m):
    p = py[i][0]
    x = pre[py[i][0]][i]
    ans = "{:0>6d}".format(p)+"{:0>6d}".format(x)
    city_nums.append(ans)
    
for c_n in city_nums:
    print(c_n)

Solution (Python):
n, m = (int(i) for i in input().split())
py = [[int(i) for i in input().split()] for j in range(m)]
pre = {}
for i in range(m):
    cur_p = py[i][0]
    cur_p_cities = pre.get(cur_p,[])
    cur_p_cities.append(i)
    pre[cur_p] = cur_p_cities

for i in pre.keys():
    pre[i].sort(key=lambda x:py[x][1])
    city_order = tuple(range(1,len(pre[i])+1))
    pre[i] = dict(zip(pre[i],city_order))

city_nums = []
for i in range(m):
    p = py[i][0]
    x = pre[py[i][0]][i]
    ans = "{:0>6d}".format(p)+"{:0>6d}".format(x)
    city_nums.append(ans)
    
for c_n in city_nums:
    print(c_n)

Solution (Python):
import bisect
N, M = map(int, input().split())
city = []
table = [0]*M
count = [0]*N
for i in range(M):
  P, Y = map(int, input().split())
  P -= 1
  city.append((i,P,Y))
city.sort(key=lambda x:x[2])
for i, P, Y in city:
  count[P] += 1
  x = str(count[P])
  P = str(P+1)
  ans = P.zfill(6)+x.zfill(6)
  table[i] = ans
for i in range(M):
  print(table[i])

Solution (Python):
import sys
from collections import defaultdict
input = sys.stdin.readline


dic = defaultdict(list)
n, m = map(int, input().split())
for i in range(m):
    pref, year = map(int, input().split())
    dic[pref].append([year, i])

cities = [0]*m


for i in range(1, n+1):
    dic[i].sort(reverse=True)
    count = 0
    while dic[i]:
        year, no = dic[i].pop()
        count += 1
        cities[no] = str(i).zfill(6) + str(count).zfill(6)

for city in cities:
    print(city)

Solution (Python):
import sys
from collections import defaultdict
input = sys.stdin.readline


dic = defaultdict(list)
n, m = map(int, input().split())
for i in range(m):
    pref, year = map(int, input().split())
    dic[pref].append([year, i])

cities = [0]*m


for i in range(1, n+1):
    dic[i].sort(reverse=True)
    count = 0
    while dic[i]:
        year, no = dic[i].pop()
        count += 1
        cities[no] = str(i).zfill(6) + str(count).zfill(6)

for city in cities:
    print(city)

Solution (Python):
n,m=map(int, input().split())
p=[1]*(n+1)
c=[]
for i in range(m):
  pi,x =map(int, input().split())
  c.append([i+1, pi, x, 0])
  


x_order = sorted(c, key=lambda e: e[2])
for e in x_order:
  e[3] = p[e[1]]
  p[e[1]] += 1

i_order = sorted(x_order)

for e in i_order:
  id=e[1]*1000000+e[3]
  print(str(id).zfill(12))

Solution (Python):

N, M = map(int, input().split())
Vs = [ list(map(int, input().split())) for _ in range(M)]

d = dict()

for v in Vs:
    if v[0] in d:
        d[v[0]].append(v[1])
    else:
        d[v[0]] = [v[1]]

for k, v in d.items():
    s = sorted(v)
    d[k] = s


ans = dict()
for k, v in d.items():
    for i in range(len(v)):
        a = v[i]
        ans[(str(k)+'-'+str(a))]  = i+1

for v in Vs:
    a = ans[(str(v[0])+'-'+str(v[1]))]
    print(str(v[0]).zfill(6) + str(a).zfill(6))

Solution (Python):

import sys
input = sys.stdin.readline

def main():
    N, M = map(int, input().split())
    ans, A, cnt = [""] * M, [], 1
    for i in range(M):
        p, y = map(int, input().split())
        A += [(p, y, i)]
    A.sort()
    ans[A[0][2]] = "{:06}{:06}".format(A[0][0], cnt)
    prev = A[0][0]
    for p, _, i in A[1:]:
        if prev == p:
            cnt += 1
        else:
            cnt = 1
        ans[i] = "{:06}{:06}".format(p, cnt)
        prev = p
    print(*ans, sep="\n")


if __name__ == "__main__":
    main()