#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
int n, k, a[maxn + 9][5];
int vis[20020115];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= k; ++j) scanf("%d", &a[i][j]);
  if (n == 1) {
    for (int j = 1; j <= k; ++j)
      if (a[1][j] == 1) {
        cout << "NO" << endl;
        return 0;
      }
    cout << "YES" << endl;
    return 0;
  }
  for (int i = 1; i <= n; ++i) {
    int res = 0;
    for (int j = 1; j <= k; ++j)
      if (a[i][j]) res |= (1 << (j - 1));
    ++vis[res];
  }
  for (int i = 0; i < (1 << k); ++i)
    for (int j = 0; j < (1 << k); ++j)
      if ((i & j) == 0 && vis[i] != 0 && vis[j] != 0) {
        cout << "YES" << endl;
        return 0;
      }
  cout << "NO" << endl;
  return 0;
}
