#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int N = 1000;
const vector<vector<int>> TSS{
  {1, 2, 3, 4},
  {1, 2},
  {1, 2, 3},
  {1, 3, 4},
  {1, 2, 3, 4},
  {1, 2, 3, 4},
};

int O, M;
vector<vector<int>> A, B;

vector<vector<int>> graph;
pair<int, int> dfs(int u, int p) {
  pair<int, int> ret(0, u);
  for (const int v : graph[u]) if (p != v) {
    auto res = dfs(v, u);
    ++res.first;
    chmax(ret, res);
  }
  return ret;
}

int main() {
  for (; ~scanf("%d", &O); ) {
    scanf("%d", &M);
    A.resize(M);
    B.resize(M);
    for (int m = 0; m < M; ++m) {
      A[m].resize(N - 1);
      B[m].resize(N - 1);
      for (int i = 0; i < N - 1; ++i) {
        scanf("%d%d", &A[m][i], &B[m][i]);
        --A[m][i];
        --B[m][i];
      }
    }
    
    vector<pair<double, int>> fms(M);
    for (int m = 0; m < M; ++m) {
      graph.assign(N, {});
      for (int i = 0; i < N - 1; ++i) {
        const int u = A[m][i];
        const int v = B[m][i];
        graph[u].push_back(v);
        graph[v].push_back(u);
      }
      const auto res0 = dfs(0, -1);
      const auto res1 = dfs(res0.second, -1);
      const int d = res1.first;
      int c = 0;
      for (int u = 0; u < N; ++u) if (graph[u].size() == 1) ++c;
      fms[m] = make_pair(d - 0.567 * c, m);
    }
    sort(fms.begin(), fms.end());
    
    const auto &ts = TSS[O];
    assert(M % (int)ts.size() == 0);
    vector<int> ans(M, 0);
    for (int i = 0; i < M; ++i) {
      ans[fms[i].second] = ts[i / (M / (int)ts.size())];
    }
    
    for (int m = 0; m < M; ++m) {
      printf("%d\n", ans[m]);
    }
  }
  return 0;
}