func_code_string: #include <bits/stdc++.h>   using namespace std;   long long mod = 1e9 + 7;   long long N = 100107;   long long binpow(long long x, long long y) {     if (y == 0) return 1;     if (y == 1)       return x % mod;     else if (y % 2 == 0) {       long long w = binpow(x, y / 2) % mod;       return (w * w) % mod;     } else       return ((x % mod) * (binpow(x, y - 1) % mod)) % mod;   }   int main() {     long long t = 1;     cin >> t;     while (t--) {       long long n, m, k, kol = 0, sum = 0;       set<long long> se1;       set<long long> se2;       vector<long long> v;       string s;       cin >> n >> m;       long long a[n + 10][m + 10];       for (long long i = 1; i <= n; i++)         for (long long j = 1; j <= m; j++) {           cin >> a[i][j];           if (a[i][j] == 1) {             se1.insert(i);             se2.insert(j);           }         }       long long mn = min(n - se1.size(), m - se2.size());       if (mn % 2 == 0)         cout <<  Vivek ;       else         cout <<  Ashish ;       cout <<   n ;     }   }   