#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
void solve() {
  int n, m;
  cin >> n >> m;
  int a[n][m];
  set<int> p;
  set<int> q;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
      if (a[i][j] == 1) {
        p.insert(i);
        q.insert(j);
      }
    }
  }
  n -= p.size();
  m -= q.size();
  if (min(n, m) % 2 == 0)
    cout << "Vivek \n";
  else
    cout << "Ashish \n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
