#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n, m;
  cin >> n >> m;
  ;
  unordered_map<long long int, long long int> mr, mc;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < m; j++) {
      long long int x;
      cin >> x;
      ;
      if (x == 1) {
        mr[i]++;
        mc[j]++;
      }
    }
  }
  long long int remr = 0, remc = 0, rem = 0, ans = 0;
  for (long long int i = 0; i < n; i++) {
    if (mr[i] <= 0) remr++;
  }
  for (long long int i = 0; i < m; i++) {
    if (mc[i] <= 0) remc++;
  }
  rem = min(remr, remc);
  if (rem % 2 == 0)
    cout << "Vivek"
         << "\n";
  else
    cout << "Ashish"
         << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t-- > 0) {
    solve();
  }
  return 0;
}
