#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
const ll N = 1e7 + 10;
const ll INF = 1e10;
const ll M = 1e3 + 1;
const ll L = 31;
const ll mod = 1e9 + 7;
ll fact[N];
pair<ll, ll> ask(vector<ll> v) {
  cout << "? " << v.size() << " ";
  for (auto j : v) {
    cout << j << " ";
  }
  cout << endl;
  cout.flush();
  ll x, dist;
  cin >> x >> dist;
  return {x, dist};
}
ll solve() {
  ll n, m;
  cin >> n >> m;
  ll arr[n][m];
  ll row[n];
  memset(row, 0, sizeof row);
  ll col[m];
  memset(col, 0, sizeof col);
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < m; j++) {
      cin >> arr[i][j];
      if (arr[i][j] == 1) {
        row[i] = 1;
        col[j] = 1;
      }
    }
  }
  ll c1 = 0, c2 = 0;
  for (ll i = 0; i < n; i++) {
    if (row[i] == 0) c1++;
  }
  for (ll i = 0; i < m; i++) {
    if (col[i] == 0) c2++;
  }
  ll c = min(c1, c2);
  if (c % 2 == 0) {
    cout << "Vivek" << '\n';
    return 0;
  } else {
    cout << "Ashish" << '\n';
    return 0;
  }
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ll cas;
  cin >> cas;
  for (ll i = 0; i < cas; i++) {
    solve();
  }
  return 0;
}
