#include <bits/stdc++.h>
using namespace std;
int a, b;
int n, m;
vector<vector<int> > M(50, vector<int>(50));
void quantify() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (M[i][j] == 1) {
        for (int k = 0; k < n; k++) {
          if (M[k][j] == 0) M[k][j] = -1;
        }
        for (int k = 0; k < m; k++) {
          if (M[i][k] == 0) M[i][k] = -1;
        }
      }
    }
  }
}
bool checkPos() {
  int zerocounti[50], zerocountj[50], zerocountsum[50][50];
  int max = 0;
  for (int i = 0; i < n; i++) {
    zerocounti[i] = 0;
    for (int j = 0; j < m; j++) {
      zerocountsum[i][j] = 0;
      zerocountj[j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (M[i][j] == 0) {
        zerocounti[i]++;
        zerocountj[j]++;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      zerocountsum[i][j] = zerocounti[i] + zerocountj[j];
      if (zerocountsum[i][j] > max) {
        max = zerocountsum[i][j];
        a = i;
        b = j;
      }
    }
  }
  if (max == 0) return false;
  return true;
}
int main() {
  int t;
  cin >> t;
  int x;
  bool turnAshish;
  for (int y = 0; y < t; y++) {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        cin >> x;
        M[i][j] = x;
      }
    }
    quantify();
    turnAshish = true;
    while (true) {
      if (!checkPos()) break;
      M[a][b] = 1;
      quantify();
      turnAshish = !turnAshish;
    }
    if (turnAshish)
      cout << "Vivek" << endl;
    else {
      cout << "Ashish" << endl;
    }
  }
  return 0;
}
