#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9;
const long long inf64 = 1e18;
const long long MOD = inf + 7;
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 r = n;
  long long c = m;
  for (long long i = 0; i < n; i++) {
    long long cnt = 0;
    for (long long j = 0; j < m; j++) cnt += a[i][j];
    if (cnt) r--;
  }
  for (long long j = 0; j < m; j++) {
    long long cnt = 0;
    for (long long i = 0; i < n; i++) cnt += a[i][j];
    if (cnt) c--;
  }
  long long d = min(n, m);
  for (long long i = 0; i < min(n, m); i++) d -= a[i][i];
  long long cnt = d;
  r -= d;
  c -= d;
  cnt += min(r, c);
  if (cnt % 2)
    cout << "Ashish\n";
  else
    cout << "Vivek\n";
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
