#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;

const int MAXN = 1010;
int a[MAXN][MAXN];
typedef pair<int, int> pii;
#define fst first
#define snd second
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int done[MAXN][MAXN];

int main(void) {
    int T;
    scanf("%d", &T);
    while (T -- > 0) {
        int n, m;
        scanf("%d %d", &n, &m);
        int cnt = 0;
        for (int i = 1; i <= n; ++ i) {
            for (int j = 1; j <= m; ++ j) {
                scanf("%d", &a[i][j]);
                if (a[i][j] == 1) ++ cnt;
            }
        }
        bool flag = false;
        if (cnt % 2 != (n+m) % 2) flag = true;
        if (flag) printf("YES\n");
        else printf("NO\n");
    }

    return 0;
}