#include <bits/stdc++.h>
using namespace std;
vector<long long int> path;
void solve() {
  long long int n, m, i, j, c = 0, a, b;
  cin >> n >> m;
  vector<vector<long long int> > v(n, vector<long long int>(m));
  map<long long int, long long int> ho, ve;
  a = n;
  b = m;
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      cin >> v[i][j];
      if (v[i][j] == 1) {
        if (ho[i] == 0) {
          a--;
          ho[i] = 1;
        }
        if (ve[j] == 0) {
          b--;
          ve[j] = 1;
        }
      }
    }
  }
  c = min(a, b);
  if (c % 2 == 0) {
    cout << "Vivek";
  } else {
    cout << "Ashish";
  }
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    solve();
    cout << "\n";
  }
}
