#include <bits/stdc++.h>
const long long N = 1000000;
const long long mod = 1e9 + 7;
using namespace std;
int a[20];
vector<int> b;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    int sum = 0;
    for (int j = 0; j < k; j++) {
      sum *= 2;
      int t;
      cin >> t;
      sum += t;
    }
    a[sum]++;
  }
  for (int i = 0; i <= (1 << k); i++)
    if (a[i]) b.push_back(i);
  if (b[0] == 0) {
    cout << "YES"
         << "\n";
    return 0;
  }
  for (int i = 0; i < b.size() - 1; i++) {
    for (int j = i + 1; j < b.size(); j++) {
      int t = b[i] & b[j];
      if (!t) {
        cout << "YES"
             << "\n";
        return 0;
      }
    }
  }
  cout << "NO"
       << "\n";
  return 0;
}
