Problem: Berland has n cities, some of which are connected by roads. Each road is bidirectional, connects two distinct cities and for each two cities there's at most one road connecting them.

The president of Berland decided to split country into r states in such a way that each city will belong to exactly one of these r states.

After this split each road will connect either cities of the same state or cities of the different states. Let's call roads that connect two cities of the same state "inner" roads.

The president doesn't like odd people, odd cities and odd numbers, so he wants this split to be done in such a way that each city would have even number of "inner" roads connected to it.

Please help president to find smallest possible r for which such a split exists.

Input

The input contains one or several test cases. The first input line contains a single integer number t — number of test cases. Then, t test cases follow. Solve test cases separately, test cases are completely independent and do not affect each other.

Then t blocks of input data follow. Each block starts from empty line which separates it from the remaining input data. The second line of each block contains two space-separated integers n, m (1 ≤ n ≤ 2000, 0 ≤ m ≤ 10000) — the number of cities and number of roads in the Berland. Each of the next m lines contains two space-separated integers — x_i, y_i (1 ≤ x_i, y_i ≤ n; x_i ≠ y_i), which denotes that the i-th road connects cities x_i and y_i. Each pair of cities are connected by at most one road. 

Sum of values n across all test cases doesn't exceed 2000. Sum of values m across all test cases doesn't exceed 10000.

Output

For each test case first print a line containing a single integer r — smallest possible number of states for which required split is possible. In the next line print n space-separated integers in range from 1 to r, inclusive, where the j-th number denotes number of state for the j-th city. If there are multiple solutions, print any.

Example

Input

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


Output

1
1 1 1 1 1 
2
2 1 1 1 1 1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
struct graph {
  vector<int> deg;
  bitset<N> con[N];
  int n;
  graph(int n) : n(n) {}
  void add_edge(int a, int b) { con[a][b] = con[b][a] = 1; }
  pair<set<int>, set<int>> partition() {
    set<int> A, B;
    for (int i = 1; i <= n; i++) A.insert(i);
    int node = 0;
    for (int i = 1; i <= n; i++)
      if (con[i].count() & 1) node = i;
    if (node == 0) return {A, {}};
    A.clear();
    bitset<N> temp = con[node];
    con[node].reset();
    for (int i = 1; i <= n; i++) {
      con[i][node] = 0;
      if (temp[i]) {
        con[i] ^= temp;
        con[i][i] = 0;
      }
    }
    pair<set<int>, set<int>> part = partition();
    A = part.first, B = part.second;
    int cnt1 = 0, cnt2 = 0;
    for (int i = 1; i <= n; i++)
      if (temp[i]) {
        cnt1 ^= A.count(i);
        cnt2 ^= B.count(i);
      }
    if (cnt1 == 0 && !A.count(node)) {
      A.insert(node);
      B.erase(node);
    } else if (cnt1 == 1 && A.count(node)) {
      B.insert(node);
      A.erase(node);
    }
    con[node] = temp;
    for (int i = 1; i <= n; i++)
      if (temp[i]) con[i][node] = 1;
    for (int i = 1; i <= n; i++) {
      if (temp[i]) {
        con[i] ^= temp;
        con[i][i] = 0;
      }
    }
    return {A, B};
  }
};
int main() {
  int t, n = 0, m = 0;
  scanf("%d", &(t));
  while (t--) {
    scanf("%d", &(n));
    scanf("%d", &(m));
    graph g(n);
    for (int i = 1; i <= m; i++) {
      int x, y;
      scanf("%d", &(x));
      scanf("%d", &(y));
      g.add_edge(x, y);
    }
    pair<set<int>, set<int>> part = g.partition();
    printf("%d\n", (part.second.empty()) ? 1 : 2);
    for (int i = 1; i <= n; i++) {
      if (part.first.count(i))
        printf("%d ", 1);
      else
        printf("%d ", 2);
    }
    printf("\n");
  }
}