#include <bits/stdc++.h>
const int N = 1e5 + 10;
const long long inf = 0x3f3f3f3f3f3f;
using namespace std;
long long mod = 1e2 + 7;
int arr[N][110], flagx[N], flagy[N];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    memset(flagx, 0, sizeof(flagx));
    memset(flagy, 0, sizeof(flagy));
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        cin >> arr[i][j];
        if (arr[i][j] == 1) {
          flagx[i] = 1;
          flagy[j] = 1;
        }
      }
    }
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (flagx[i] == 0 && flagy[j] == 0) {
          flagx[i] = 1, flagy[j] = 1;
          cnt++;
        }
      }
    }
    if (cnt % 2 == 0)
      cout << "Vivek"
           << "\n";
    else
      cout << "Ashish"
           << "\n";
  }
  return 0;
}
