integer(16)::n,m,i,j,q,r
integer(16),allocatable::p(:),y(:),a(:),b(:),c(:)
read*,n,m
allocate(p(m),y(m),a(m))
do i = 1,m
  read*,p(i),y(i)
  a(i) = i
end do
	
call HeapsortTri(M,p,a,y)
q = 1;r = 1
do
  do 
    if(r+1 > m)exit
    if(p(r+1)/=p(r))exit
	r = r+1
  end do
  j = r-q+1
  allocate(b(j),c(j))
  b(1:j) = y(q:r)
  c(1:j) = a(q:r)
  
  call HeapsortPair(J,b,c)
  
  do i = 1,j
    b(i) = i
  enddo
  y(q:r) = b(1:j)
  a(q:r) = c(1:j)
  q = r+1
  r = r+1
  deallocate(b,c)
  if(r>m)exit
end do
	
call heapsorttri(m,a,p,y)
	
do i = 1,m
  print"(i12.12)",p(i)*1000000+y(i)
end do

contains
subroutine HeapsortTri(n,array,array2,array3)
  implicit none
!ここの入力は状況に応じて変更すること
  integer(16),intent(in) :: n
  integer(16),intent(inout) :: array(1:n),array2(1:n),array3(1:N)
  integer(16)::i,k,j,l
  integer(16):: t,t2,t3

  l=n/2+1
  k=n
  do while(k /= 1)
     if(l > 1)then
        l=l-1
        t=array(L)
        t2=array2(L)
        t3=array3(L)
     else
        t=array(k)
        t2=array2(k)
        t3=array3(k)
        array(k)=array(1)
        array2(k)=array2(1)
        array3(k)=array3(1)
        k=k-1
        if(k == 1) then
           array(1)=t
           array2(1)=t2
           array3(1)=t3
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j<=k)
        if(j < k)then
           if(array(j) < array(j+1))j=j+1
        endif
        if (t < array(j))then
           array(i)=array(j)
           array2(i)=array2(j)
           array3(i)=array3(j)
           i=j
           j=j+j
        else
           j=k+1
        endif
     enddo
     array(i)=t
     array2(i)=t2
     array3(i)=t3
  enddo
  return
end subroutine HeapsortTri


subroutine HeapsortPair(n,array,array2)
  implicit none
!ここの入力は状況に応じて変更すること
  integer(16),intent(in) :: n
  integer(16),intent(inout) :: array(1:n),array2(1:n)
  integer(16)::i,k,j,l
  integer(16):: t,t2

  l=n/2+1
  k=n
  do while(k /= 1)
     if(l > 1)then
        l=l-1
        t=array(L)
        t2=array2(L)
     else
        t=array(k)
        t2=array2(k)
        array(k)=array(1)
        array2(k)=array2(1)
        k=k-1
        if(k == 1) then
           array(1)=t
           array2(1)=t2
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j<=k)
        if(j < k)then
           if(array(j) < array(j+1))j=j+1
        endif
        if (t < array(j))then
           array(i)=array(j)
           array2(i)=array2(j)
           i=j
           j=j+j
        else
           j=k+1
        endif
     enddo
     array(i)=t
     array2(i)=t2
  enddo
  return
end subroutine HeapsortPair
end