#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300000;
const int INF = 0x3f3f3f3f;
bool occur[20];
int main(int argc, char const *argv[]) {
  long long n, k;
  while (cin >> n >> k) {
    memset(occur, 0, sizeof occur);
    while (n--) {
      long long te, sum = 0, digit = 1;
      for (long long i = 1; i <= k; i++) {
        scanf("%lld", &te), sum += te * digit;
        digit *= 2;
      }
      occur[sum] = 1;
    }
    long long lim = 1;
    for (long long i = 1; i <= k; ++i) lim *= 2;
    bool find = 0;
    if (occur[0] == 1) find = 1;
    for (int i = 0; i < lim; ++i) {
      if (occur[i])
        for (int j = i + 1; j < lim; ++j)
          if (occur[j] && (i & j) == 0) find = 1;
    }
    if (find)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
