// Slower C++ solution:
#pragma GCC optimize("Ofast")

#include <iostream>

#include <vector>

#include <algorithm>

#include <iomanip>

#include <utility>

using namespace std;



template<typename T> void fastin(T &num) {

  bool negative = false;

  T c;

  num = 0;

  c = getchar_unlocked();

  if (c == '-') {

    negative = true;

    c = getchar_unlocked();

  }

  for (; (c > 47 && c < 58); c = getchar_unlocked()) num = (num << 3) + (num << 1) + c - 48;

  if (negative) num *= -1;

}



struct task{

  int year, id;

};



int main(){

  int n, m; fastin(n); fastin(m);

  vector<task> v[101010];

  for (int i = 0; i < m; ++i) {

    int p, y; fastin(p); fastin(y);

    v[p].push_back({y, i + 1});

  }



  vector<int> ans1(m + 1), ans2(m + 1);



  for (int i = 1; i <= n; ++i) {

    if (v[i].empty()) continue;

    sort(v[i].begin(), v[i].end(), [](const task &x, const task &y){

      return x.year < y.year;

    });

  }



  for (int i = 1; i <= n; ++i) {

    for (int j = 0; j < (int)v[i].size(); ++j) {

      ans1[v[i][j].id] = i;

      ans2[v[i][j].id] = j + 1;

    }

  }



  for (int i = 1; i <= m; ++i) {

    cout << setfill('0') << right << setw(6) << ans1[i] << setfill('0') << right << setw(6) << ans2[i] << '\n';

  }



  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.491366240334299x):
#pragma region kyomukyomupurin



/**

 *    author  : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏

 *    created : 2020-05-28 16:42:03

 **/



#include <algorithm>

#include <bitset>

#include <cassert>

#include <cctype>

#include <chrono>

#include <cmath>

#include <complex>

#include <deque>

#include <iomanip>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <random>

#include <set>

#include <stack>

#include <string>

#include <tuple>

#include <utility>

#include <vector>



using namespace std;



using int64 = long long;



template <class T>

using binary_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;



template <class T, class U>

std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {

  return os << '(' << p.first << ", " << p.second << ')';

}

/*

template <class Ch, class Tr, class Tuple, std::size_t... Is>

void tuple_out(std::basic_ostream<Ch, Tr>& os, const Tuple& tp, std::index_sequence<Is...>) {

  ((os << (Is ? ", " : "(") << std::get<Is>(tp)), ...) << ")";

}



template <class Ch, class Tr, class... Args>

auto& operator<<(std::basic_ostream<Ch, Tr>& os, const std::tuple<Args...>& tp) {

  tuple_out(os, tp, std::index_sequence_for<Args...>{});

  return os;

}

*/

template <class T>

std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {

  int n = 0;

  for (auto e : vec) os << (n++ ? ", " : "{") << e;

  return os << (n ? "}" : "{}");

}



template <class T, class Compare>

std::ostream& operator<<(std::ostream& os, const std::set<T, Compare>& st) {

  int n = 0;

  for (auto e : st) os << (n++ ? ", " : "{") << e;

  return os << (n ? "}" : "{}");

}



template <class T, class U, class Compare>

std::ostream& operator<<(std::ostream& os, const std::map<T, U, Compare>& mp) {

  int n = 0;

  for (auto e : mp) os << (n++ ? ", " : "{") << e;

  return os << (n ? "}" : "{}");

}



template <class T>

std::istream& operator>>(std::istream& is, std::vector<T>& vec) {

  for (T& e : vec) is >> e;

  return is;

}



#define all(_) begin(_), end(_)

#define rall(_) rbegin(_), rend(_)



#ifdef LOCAL

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)

#else

#define debug(...)

#endif



void debug_out() { std::cerr << '\n'; }



template <class Head, class... Tail>

void debug_out(Head&& head, Tail&&... tail) {

  std::cerr << head;

  if (sizeof...(Tail) != 0) std::cerr << ", ";

  debug_out(std::forward<Tail>(tail)...);

}



#pragma endregion kyomukyomupurin



int main() {

  ios_base::sync_with_stdio(false);

  cin.tie(nullptr);



  int n; cin >> n;

  int m; cin >> m;



  vector<pair<int, int>> in(m);

  for (int i = 0; i < m; ++i) {

    cin >> in[i].first >> in[i].second;

  }



  vector<vector<int>> v(n + 1);

  for (auto e : in) {

    v[e.first].emplace_back(e.second);

  }



  for (int i = 0; i < n + 1; ++i) {

    if (v[i].empty()) continue;

    sort(all(v[i]));

  }



  debug(v);



  auto padding = [](int num) -> string {

    string ret = to_string(num);

    while ((int)ret.size() < 6) {

      string t = "0";

      t += ret;

      swap(ret, t);

    }

    return ret;

  };



  for (auto e : in) {

    cout << padding(e.first) << padding((int)distance(v[e.first].begin(), lower_bound(v[e.first].begin(), v[e.first].end(), e.second)) + 1) << '\n';

  }



  return 0;

}