1249-timus

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse3,avx,avx2,popcnt,tune=native")
#pragma comment(linker, "/STACK:367077216")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <queue>
#include <iomanip>

using namespace std;

typedef long long ll;

int main() {

    int n, m;
    cin >> n >> m;

    vector <int> prev(m + 1, 0), cur(m + 1, 0), prev_s(m + 1, 0), cur_s(m + 1, 0);
    for (int i = 1; i <= m; ++i) {
        cin >> prev[i];
        prev_s[i] = prev_s[i - 1] + prev[i];
    }

    vector <int> prev_g, cur_g;
    for (int i = 1; i <= m; ++i) {
        if (prev[i] == 1 && prev[i - 1] == 0) {
            prev_g.push_back(i);
        }
        if (prev[i] == 1 && (i == m || prev[i + 1] == 0)) {
            prev_g.push_back(i);
        }
    }

    for (int step = 1; step < n; ++step) {

        for (int i = 1; i <= m; ++i) {
            cin >> cur[i];
            cur_s[i] = cur_s[i - 1] + cur[i];
        }

        for (int i = 1; i <= m; ++i) {
            if (cur[i] == 1 && cur[i - 1] == 0) {
                cur_g.push_back(i);
            }
            if (cur[i] == 1 && (i == m || cur[i + 1] == 0)) {
                cur_g.push_back(i);
            }
        }

        for (int i = 1; i < (int)prev_g.size(); i += 2) {
            if (cur_s[prev_g[i]] - cur_s[prev_g[i - 1] - 1] == 0) {
                continue;
            }
            else if (cur_s[prev_g[i]] - cur_s[prev_g[i - 1] - 1] == prev_g[i] - prev_g[i - 1] + 1 &&
                (cur[prev_g[i - 1] - 1] == 0) && (prev_g[i] == m || cur[prev_g[i] + 1] == 0)) {
                continue;
            }
            else {
                cout << "No";
                return 0;
            }
        }

        prev = cur;
        prev_s = cur_s;
        prev_g = cur_g;
        cur_g.clear();

    }

    cout << "Yes";

    return 0;
}