#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  gcd(b, a % b);
}
void sieve() {
  int i, j;
  int b[1000009];
  for (i = 2; i < 1000009; i++) {
    if (b[i] == 0) {
      for (j = 2 * i; j < 1000009; j = j + i) b[j] = 1;
    }
  }
}
int bs(pair<int, int> p[], int n, int key, int i) {
  int low = i, high = n - 1;
  int ans = -1;
  while (low <= high) {
    int mid = low + high;
    mid = mid / 2;
    if (p[mid].first > key)
      high = mid - 1;
    else {
      low = mid + 1;
      ans = mid;
    }
  }
  return ans;
}
int gcdExtended(int a, int b, int *x, int *y);
int modInverse(int a, int m) {
  int x, y;
  int g = gcdExtended(a, m, &x, &y);
  if (g != 1)
    cout << "Inverse doesn't exist";
  else {
    int res = (x % m + m) % m;
    return res;
  }
}
int gcdExtended(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
struct piyush {
  int tm;
  int fa;
  int fb;
};
bool operator<(piyush a, piyush b) { return a.tm > b.tm; }
bool cmp(piyush a, piyush b) { return a.tm < b.tm; }
signed main() {
  int n, i, j, k, t;
  cin >> n >> k;
  int bits[16];
  memset(bits, 0, sizeof(bits));
  int a[n][k];
  int numb = 0;
  for (i = 0; i < n; i++) {
    for (j = 0; j < k; j++) {
      cin >> a[i][j];
      numb += (1 << j);
    }
  }
  for (i = 0; i < n; i++) {
    int num = 0;
    for (j = 0; j < k; j++) {
      if (a[i][j] > 0) {
        num += 1 << j;
      }
    }
    bits[num]++;
  }
  int z = 0;
  for (i = 0; i < 16; i++) {
    for (j = i + 1; j < 16; j++) {
      if (bits[i] > 0 && bits[j] > 0) {
        k = i & j;
        if (k == 0) z = 1;
      }
    }
  }
  if (z == 1 || bits[0] > 1 || (n == 1 && bits[0] == 1))
    printf("YES\n");
  else
    printf("NO\n");
}
