#include <bits/stdc++.h>
using namespace std;
long long bin_exp(long long a, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * a;
    a = a * a;
    n = n >> 1;
  }
  return res;
}
long long bin_exp_modulo(long long a, long long n, long long m) {
  if (a == 0) return 0;
  long long res = 1;
  a = a % m;
  while (n) {
    if (n & 1) res = ((res % m) * (a % m)) % m;
    a = ((a % m) * (a % m)) % m;
    n = n >> 1;
  }
  return res % m;
}
void work() {
  int n, m;
  cin >> n >> m;
  int mat[n][m];
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) cin >> mat[i][j];
  int nRows = 0, nCols = 0;
  bool isClaim;
  for (int i = 0; i < n; ++i) {
    isClaim = true;
    for (int j = 0; j < m; ++j) {
      if (mat[i][j] == 1) {
        isClaim = false;
        break;
      }
    }
    if (isClaim) ++nRows;
  }
  for (int i = 0; i < m; ++i) {
    isClaim = true;
    for (int j = 0; j < n; ++j) {
      if (mat[j][i] == 1) {
        isClaim = false;
        break;
      }
    }
    if (isClaim) ++nCols;
  }
  int ans = min(nRows, nCols);
  if (ans % 2 == 0)
    cout << "Vivek";
  else
    cout << "Ashish";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test;
  cin >> test;
  for (int i = 0; i < test; ++i) {
    work();
    cout << "\n";
  }
  return 0;
}
