#include <bits/stdc++.h>

using namespace std;
void solve()
{
    int n, m, k = 0, t;
    cin >> n >> m;
    set<int> x, y;
    vector<int> a(max(n, m));
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < m; ++j){
            cin >> t;
            if(t)
                x.insert(i), y.insert(j);
        }
    }
    k = min(n - x.size(), m - y.size());
    if(k % 2 == 0)
        cout << "Vivek";
    else
        cout << "Ashish";
    cout << endl;
}
int main()
{
    int t;
    cin >> t;
    while(t--)
        solve();
    return 0;
}

#include <vector>
#include <iostream>

using namespace std;

int main() {
    int n, m, t, current, maxHorizontal, maxVertical, min = 0, max;
    cin >> t;
    vector<vector<int>> field;
    for (int i = 0; i < t; ++i) {
        cin >> n;
        cin >> m;
        field.resize(n + 1, vector<int>(m + 1));
        for (int j = 1; j <= n; ++j) {
            for (int k = 1; k <= m; ++k) {
                cin >> current;
                field[j][k] = current;
                if (current == 1) {
                    field[0][k] = 1;
                    field[j][0] = 1;
                }
            }
        }
        maxHorizontal = 0;
        maxVertical = 0;
        for (int j = 1; j <= n; ++j) {
            if (field[j][0] == 0) {
                maxVertical++;
            }
        }
        for (int j = 1; j <= m; ++j) {
            if (field[0][j] == 0) {
                maxHorizontal++;
            }
        }
        min = __min(maxHorizontal, maxVertical);
        if (min % 2 == 1) {
            cout << "Ashish";
        } else {
            cout << "Vivek";
        }
        cout << endl;
        field.clear();
    }
}