#include <bits/stdc++.h>
using namespace std;
const int N = 605;
const int M = 605;
int n, m, k;
int a[M], b[M];
int deg[N];
vector<int> edges_matched_to_vertex[N];
int col[M];
const int INF = 1000000000;
struct Edge {
  int from, to, cap, flow, index;
  Edge(int from, int to, int cap, int flow, int index)
      : from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct Dinic {
  int N;
  vector<vector<Edge>> G;
  vector<Edge *> dad;
  vector<int> Q;
  Dinic(int N) : N(N), G(N), dad(N), Q(N) {}
  void AddEdge(int from, int to, int cap) {
    G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
    if (from == to) G[from].back().index++;
    G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
  }
  long long BlockingFlow(int s, int t) {
    fill(dad.begin(), dad.end(), (Edge *)NULL);
    dad[s] = &G[0][0] - 1;
    int head = 0, tail = 0;
    Q[tail++] = s;
    while (head < tail) {
      int x = Q[head++];
      for (int i = 0; i < G[x].size(); i++) {
        Edge &e = G[x][i];
        if (!dad[e.to] && e.cap - e.flow > 0) {
          dad[e.to] = &G[x][i];
          Q[tail++] = e.to;
        }
      }
    }
    if (!dad[t]) return 0;
    long long totflow = 0;
    for (int i = 0; i < G[t].size(); i++) {
      Edge *start = &G[G[t][i].to][G[t][i].index];
      int amt = INF;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        if (!e) {
          amt = 0;
          break;
        }
        amt = min(amt, e->cap - e->flow);
      }
      if (amt == 0) continue;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        e->flow += amt;
        G[e->to][e->index].flow -= amt;
      }
      totflow += amt;
    }
    return totflow;
  }
  long long GetMaxFlow(int s, int t) {
    long long totflow = 0;
    while (long long flow = BlockingFlow(s, t)) totflow += flow;
    return totflow;
  }
};
void err() {
  for (int i = 1; i <= m; i++) {
    cout << "0 ";
  }
  cout << endl;
}
void solve() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    deg[i] = 0;
    edges_matched_to_vertex[i].clear();
  }
  for (int i = 1; i <= m; i++) {
    cin >> a[i] >> b[i];
    col[i] = 0;
    deg[a[i]]++;
    deg[b[i]]++;
  }
  Dinic mf(m + n + 2);
  for (int i = 1; i <= m; i++) {
    if (max(deg[a[i]], deg[b[i]]) > 2 * k) {
      err();
      return;
    }
    if (deg[a[i]] > k) {
      mf.AddEdge(i, m + a[i], 1);
    }
    if (deg[b[i]] > k) {
      mf.AddEdge(i, m + b[i], 1);
    }
  }
  for (int i = 1; i <= m; i++) {
    mf.AddEdge(0, i, 1);
  }
  int sum = 0;
  for (int i = m + 1; i <= m + n; i++) {
    if (deg[i - m] > k) {
      mf.AddEdge(i, m + n + 1, 2 * (deg[i - m] - k));
      sum += 2 * (deg[i - m] - k);
    }
  }
  int max_flow = mf.GetMaxFlow(0, m + n + 1);
  if (max_flow < sum) {
    err();
    return;
  }
  int color = 0;
  vector<vector<Edge>> residual = mf.G;
  for (int edge = 1; edge <= m; edge++) {
    for (auto e : residual[edge]) {
      int vertex = e.to;
      if (e.flow == 1) {
        edges_matched_to_vertex[vertex - m].push_back(edge);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (int)edges_matched_to_vertex[i].size(); j += 2) {
      col[edges_matched_to_vertex[i][j]] =
          col[edges_matched_to_vertex[i][j + 1]] = ++color;
    }
  }
  for (int i = 1; i <= m; i++) {
    if (col[i] == 0) {
      col[i] = ++color;
    }
    cout << col[i] << ' ';
  }
  cout << endl;
}
int main() {
  ios ::sync_with_stdio(false);
  int z;
  cin >> z;
  while (z--) {
    solve();
  }
}
