#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, m;
  cin >> n >> m;
  long long a[n][m];
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  long long good_coln = 0, good_row = 0;
  for (long long i = 0; i < n; i++) {
    long long flag = true;
    for (long long j = 0; j < m; j++) {
      if (a[i][j] == 1) {
        flag = false;
      }
    }
    if (flag) good_row++;
  }
  for (long long i = 0; i < m; i++) {
    long long flag = true;
    for (long long j = 0; j < n; j++) {
      if (a[j][i] == 1) {
        flag = false;
      }
    }
    if (flag) good_coln++;
  }
  long long def = min(good_coln, good_row);
  if (def % 2 == 0) {
    cout << "Vivek" << endl;
  } else {
    cout << "Ashish" << endl;
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
