#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
;
const int M = 255;
const int mod = 998244353;
const int mo = 123;
const double pi = acos(-1.0);
int n, m;
int ans = 0;
int vis[N];
vector<int> vec;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    int res = 0;
    for (int j = 0, x; j < m; j++) {
      scanf("%d", &x);
      if (x) res |= (1 << j);
    }
    if (!vis[res]) {
      vec.push_back(res);
      vis[res]++;
    }
  }
  bool ok = false;
  for (int i = 0; i < vec.size(); i++) {
    for (int j = 0; j < vec.size(); j++) {
      int x = vec[i] + vec[j];
      int y = vec[i] ^ vec[j];
      if (x == y) ok = true;
    }
  }
  if (ok)
    puts("YES");
  else
    puts("NO");
  return 0;
}
