#include <bits/stdc++.h>
using namespace std;
template <typename T>
using vc = vector<T>;
template <typename T, typename X>
using pr = pair<T, X>;
const long long int MOD = 1e9 + 7;
const long double PI = 3.14159265;
long long int powerWithMod(long long int base, long long int exponent,
                           long long int modulus = LLONG_MAX) {
  long long int result = 1;
  base %= modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent >>= 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long int modInverse(long long int a, long long int m = MOD) {
  return powerWithMod(a, m - 2, m);
}
int n, k, x, y;
map<int, int> a;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    x = 0;
    for (int i = 0; i < k; i++) {
      cin >> y;
      x <<= 1;
      x += y;
    }
    a[x]++;
  }
  if (a[0] > 0) {
    cout << "YES\n";
    return 0;
  }
  for (int i = 0; i < k; i++) {
    if (a[1 << i] == 0) continue;
    for (int j = 1; j < (1 << k); j++) {
      if (j & (1 << i)) continue;
      if (a[j]) {
        cout << "YES\n";
        return 0;
      }
    }
  }
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < k; j++) {
      if (a[(1 << i) + (1 << j)] == 0) continue;
      for (int l = 1; l < (1 << k); l++) {
        if (l & ((1 << i) + (1 << j))) continue;
        if (a[l]) {
          cout << "YES\n";
          return 0;
        }
      }
    }
  }
  cout << "NO\n";
  return 0;
}
