The king of some country N decided to completely rebuild the road network. There are n people living in the country, they are enumerated from 1 to n. It is possible to construct a road between the house of any citizen a to the house of any other citizen b. There should not be more than one road between any pair of citizens. The road network must be connected, i.e. it should be possible to reach every citizen starting from anyone using roads. To save funds, it was decided to build exactly n-1 road, so the road network should be a tree.

However, it is not that easy as it sounds, that's why the king addressed you for help. There are m secret communities in the country, each of them unites a non-empty subset of citizens. The king does not want to conflict with any of the communities, so he wants to build the network such that the houses of members of each society form a connected subtree in network. A set of vertices forms a connected subtree if and only if the graph remains connected when we delete all the other vertices and all edges but ones that connect the vertices from the set.

Help the king to determine if it is possible to build the desired road network, and if it is, build it.

Input

Each test consists of one or more test cases.

The first line contains a single integer t (1 ≤ t ≤ 2000) — the number of test cases.

The following lines describe the test cases, each in the following format.

The first line contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of citizens and the number of secret communities. 

The next m lines contain the description of the communities. The i-th of these lines contains a string s_i of length n, consisting of characters '0' and '1'. The citizen with number j is a member of the i-th community if and only if s_{{i}{j}}=1. It is guaranteed that the string s_i contains at least one character '1' for each 1 ≤ i ≤ m.

It is guaranteed that the sum of n for all test cases does not exceed 2000 and the sum of m for all test cases does not exceed 2000.

Output

Print the answer for all test cases in the order they are given in the input, each in the following format.

If there is no way to build the desired road network, print "NO" (without quotes).

Otherwise in the first line print "YES" (without quotes).

In the next n-1 lines print the description of the road network: each line should contain two integers a and b (1 ≤ a, b ≤ n, a ≠ b) that denote you build a road between houses of citizens a and b. 

The roads should form a connected tree, and each community should form a connected subtree.

Example

Input

2
4 3
0011
1110
0111
3 3
011
101
110


Output

YES
1 3
2 3
3 4
NO

Note

In the first example you can build the following network:

<image>

It is easy to see that for each community all the houses of its members form a connected subtree. For example, the 2-nd community unites the citizens 1, 2, 3. They form a connected subtree, because if we delete everything except the houses 1, 2, 3 and the roads between them, two roads will remain: between 1 and 3 and between 2 and 3, forming a connected graph.

There is no network in the second example suitable for the king.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000 + 10;
const int maxE = 2000000 + 10;
const int DEBUG = 0;
int n, m;
bitset<maxn> val[maxn];
char S[maxn];
struct anode {
  int u, v, w;
  anode() {}
  anode(int _u, int _v, int _w) : u(_u), v(_v), w(_w) {}
} a[maxE];
int h[maxn], ecnt, sfa[maxn];
struct enode {
  int v, n;
  enode() {}
  enode(int _v, int _n) : v(_v), n(_n) {}
} e[maxE << 1];
inline void addedge(int u, int v) {
  ecnt++;
  e[ecnt] = enode(v, h[u]);
  h[u] = ecnt;
}
int findfa(int u) { return (sfa[u] == u) ? (u) : (sfa[u] = findfa(sfa[u])); }
inline bool cmp(anode a, anode b) { return a.w > b.w; }
int flag, vis[maxn][maxn], all;
void dfs(int u, int fa, int k) {
  if (vis[k][u]) all++;
  vis[k][u] = 0;
  for (int i = h[u]; ~i; i = e[i].n) {
    int v = e[i].v;
    if (v == fa) continue;
    if (!vis[k][v]) continue;
    dfs(v, u, k);
  }
}
void dfs_ans(int u, int fa) {
  for (int i = h[u]; ~i; i = e[i].n) {
    int v = e[i].v;
    if (v == fa) continue;
    printf("%d %d\n", u, v);
    dfs_ans(v, u);
  }
}
inline void solve() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) val[i].reset();
  for (int i = 1; i <= m; i++) {
    scanf("%s", S + 1);
    int cnt = 0;
    for (int j = 1; j <= n; j++)
      if (S[j] == '1') cnt++;
    for (int j = 1; j <= n; j++) vis[i][j] = 0;
    if (cnt <= 1) continue;
    for (int j = 1; j <= n; j++)
      if (S[j] == '1') {
        val[j][i] = 1;
        vis[i][j] = 1;
      }
  }
  int tot = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
      int w = (val[i] & val[j]).count();
      a[++tot] = anode(i, j, w);
    }
  }
  sort(a + 1, a + tot + 1, cmp);
  for (int i = 1; i <= n; i++) sfa[i] = i, h[i] = -1;
  ecnt = 0;
  for (int i = 1; i <= tot; i++) {
    int u = a[i].u, v = a[i].v;
    int f1 = findfa(u), f2 = findfa(v);
    if (f1 == f2) continue;
    if (DEBUG) printf("%d %d %d\n", u, v, a[i].w);
    addedge(u, v);
    addedge(v, u);
    sfa[f1] = f2;
  }
  flag = 1;
  for (int i = 1; i <= m; i++) {
    all = 0;
    int now = 0;
    for (int j = 1; j <= n; j++)
      if (vis[i][j]) now++;
    for (int j = 1; j <= n; j++)
      if (vis[i][j]) {
        dfs(j, 0, i);
        break;
      }
    if (now != all) flag = 0;
  }
  if (flag) {
    puts("YES");
    dfs_ans(1, 0);
    return;
  }
  puts("NO");
}
int main() {
  int cas;
  scanf("%d", &cas);
  while (cas--) {
    solve();
  }
  return 0;
}
