#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
int n, k, t[30];
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; ++i) {
    int num = 0, bit;
    for (int j = 0; j < k; ++j) {
      num *= 2;
      cin >> bit;
      num += bit;
    }
    t[num]++;
  }
  if (t[0]) {
    puts("YES");
    return 0;
  }
  bool ok = 0;
  for (int i = 0; i < (1 << k); ++i) {
    for (int j = 0; j < (1 << k); ++j) {
      if (i == j || !t[i] || !t[j] || (i ^ j) != (i + j)) continue;
      ok = 1;
    }
    if (ok) {
      puts("YES");
      return 0;
    }
  }
  puts("NO");
  return 0;
}
