Problem: There are n cities and m two-way roads in Berland, each road connecting two distinct cities.

Recently the Berland government has made a tough decision to transfer ownership of the roads to private companies. In total, there are 100500 private companies in Berland, numbered by integers from 1 to 100500. After the privatization, every road should belong to exactly one company.

The anti-monopoly committee demands that after the privatization each company can own at most two roads. The urbanists of Berland also stated their opinion: each city should be adjacent to the roads owned by at most k companies.

Help the government to distribute the roads between the companies so that both conditions are satisfied. That is, each company gets at most two roads, and each city has roads of at most k distinct companies adjacent to it.

Input

Input contains one or several test cases. The first line contains an integer t (1 ≤ t ≤ 300) — the number of test cases in the input. Solve test cases separately, test cases are completely independent and do not affect each other.

The following lines describe the test cases. Each case starts with a line consisting of three space-separated integers n, m and k (2 ≤ n ≤ 600, 1 ≤ m ≤ 600, 1 ≤ k ≤ n - 1) — the number of cities, the number of roads and the maximum diversity of the roads adjacent to a city.

Then m lines follow, each having a pair of space-separated integers a_i, b_i (1 ≤ a_i, b_i ≤ n; a_i ≠ b_i). It means that the i-th road connects cities a_i and b_i. All roads are two-way. There is at most one road between a pair of the cities.

The sum of n values for all test cases doesn't exceed 600. The sum of m values for all test cases doesn't exceed 600.

Output

Print t lines: the i-th line should contain the answer for the i-th test case. For a test case, print a sequence of integers c_1, c_2, ..., c_m separated by space, where c_i (1 ≤ c_i ≤ 100500) is the company which owns the i-th road in your plan. If there are multiple solutions, output any of them. If there is no solution for a test case, print c_1=c_2=…=c_m=0.

Example

Input

3
3 3 2
1 2
2 3
3 1
4 5 2
1 2
1 3
1 4
2 3
2 4
4 6 2
1 2
1 3
1 4
2 3
2 4
3 4


Output

1 2 3 
2 1 1 2 3 
0 0 0 0 0 0 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int in[1255], need[1255];
struct edge {
  int to;
  int cap;
  int rev;
};
vector<edge> g[1255];
int iter[1255], level[1255];
void add_edge(int from, int to, int cap) {
  g[from].push_back((edge){to, cap, (int)g[to].size()});
  g[to].push_back((edge){from, 0, (int)g[from].size() - 1});
}
void bfs(int s) {
  queue<int> que;
  memset(level, -1, sizeof(level));
  que.push(s);
  level[s] = 0;
  while (!que.empty()) {
    int u = que.front();
    que.pop();
    for (auto e : g[u]) {
      if (e.cap > 0 && level[e.to] < 0) {
        level[e.to] = level[u] + 1;
        que.push(e.to);
      }
    }
  }
}
int dfs(int v, int t, int f) {
  if (v == t) return f;
  for (int &i = iter[v]; i < (int)g[v].size(); i++) {
    edge &e = g[v][i];
    if (e.cap > 0 && level[e.to] > level[v]) {
      int d = dfs(e.to, t, min(f, e.cap));
      if (d > 0) {
        e.cap -= d;
        g[e.to][e.rev].cap += d;
        return d;
      }
    }
  }
  return 0;
}
int max_flow(int s, int t) {
  int res = 0;
  for (;;) {
    bfs(s);
    if (level[t] < 0) return res;
    int f;
    memset(iter, 0, sizeof(iter));
    while ((f = dfs(s, t, INF)) > 0) res += f;
  }
}
pair<int, int> w[1255];
vector<int> match[1255];
int ans[1255];
int main() {
  int _T;
  scanf("%d", &_T);
  while (_T--) {
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);
    memset(in, 0, sizeof(in));
    memset(need, 0, sizeof(need));
    for (int i = 1; i <= n; i++) match[i].clear();
    for (int i = 0; i <= n + m + 1; i++) g[i].clear();
    for (int i = 0; i < m; i++) {
      int x, y;
      scanf("%d%d", &x, &y);
      in[x]++;
      in[y]++;
      w[i] = make_pair(x, y);
    }
    bool gg = 0;
    int tot = 0;
    for (int i = 1; i <= n; i++) {
      if (in[i] > 2 * k) gg = 1;
      if (in[i] <= k) continue;
      need[i] = 2 * (in[i] - k);
      tot += need[i];
    }
    if (gg) {
      for (int i = 0; i < m; i++) {
        if (i == 0)
          printf("0");
        else
          printf(" 0");
      }
      printf("\n");
      continue;
    }
    for (int i = 0; i < m; i++) {
      add_edge(w[i].first, n + i + 1, 1);
      add_edge(w[i].second, n + i + 1, 1);
      add_edge(n + i + 1, n + m + 1, 1);
    }
    for (int i = 1; i <= n; i++) {
      add_edge(0, i, need[i]);
    }
    int cool = max_flow(0, n + m + 1);
    if (cool != tot) {
      for (int i = 0; i < m; i++) {
        if (i == 0)
          printf("0");
        else
          printf(" 0");
      }
      printf("\n");
      continue;
    }
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j < g[i].size(); j++) {
        if (g[i][j].to > n && g[i][j].to <= n + m && g[i][j].cap == 0) {
          match[i].push_back(g[i][j].to - n - 1);
        }
      }
    }
    memset(ans, -1, sizeof(ans));
    int nxt = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j < match[i].size(); j += 2) {
        nxt++;
        ans[match[i][j]] = nxt;
        ans[match[i][j + 1]] = nxt;
      }
    }
    for (int i = 0; i < m; i++) {
      if (ans[i] == -1) ans[i] = ++nxt;
    }
    for (int i = 0; i < m; i++) {
      if (i == 0)
        printf("%d", ans[i]);
      else
        printf(" %d", ans[i]);
    }
    printf("\n");
  }
}