#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");
  }
}
