CF #648 A

#include<bits/stdc++.h>
using namespace std;
typedef long long           ll;
typedef unsigned long long  ull;

#define test                int t; cin>>t; while (t--)
#define sc(a)               scanf("%lld",&a)
#define sc2(a,b)            scanf("%lld %lld",&a,&b)
#define srev                reverse(s.begin(),s.end())
#define sortstr             sort(s.begin(), s.end());
#define gtl(x)              getline(cin, (x))
#define PI                  acos(-1)
#define Precision(a)        cout << fixed << setprecision(a)
#define Faster              ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

template <typename T> T Sqr(T x) { T n = x * x ; return n ;}
template <typename T> T Pow(T B,T P){ if(P==0) return 1; if(P&1) return B*Pow(B,P-1);  else return Sqr(Pow(B,P/2));}
template <typename T> T Abs(T a) {if(a<0)return -a;else return a;}
template <typename T> T Gcd(T a,T b){if(a<0)return Gcd(-a,b);if(b<0)return Gcd(a,-b);return (b==0)?a:Gcd(b,a%b);}
template <typename T> T Lcm(T a,T b) {if(a<0)return Lcm(-a,b);if(b<0)return Lcm(a,-b);return a*(b/Gcd(a,b));}
//scanf("%[^\n]%*c", str);
//sort(s,s+n,greater<int>());
const int N=55;
int main()
{
    Faster
    test
    {
        int n, m;
        cin >> n >> m;
        int r[N], c[N];
        memset(r, 0, sizeof r);
        memset(c, 0, sizeof c);
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                int k;
                cin >> k;
                if(k==1) r[i]++, c[j]++;
            }
        }
        int row=0, col=0;
        for(int i=0; i<n; i++)
            row+=!r[i];
        for(int i=0; i<m; i++)
            col+=!c[i];
        if(min(row, col) & 1) cout << "Ashish\n";
        else cout << "Vivek\n";
    }
    return 0;
}