#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.);
const double eps = 1e-15;
const int MOD = 1e9 + 7;
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long s = power(x, y / 2);
  s *= s;
  if (y & 1) s *= x;
  return s;
}
long long Ceil(long long x, long long y) { return (x + y - 1) / y; }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int n, k;
int a[100005][4];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  set<int> s;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < k; j++) cin >> a[i][j];
  for (int i = 0; i < n; i++) {
    int num = 0;
    for (int j = k - 1; j >= 0; j--)
      if (a[i][j] == 1) num += power(2, k - j - 1);
    s.insert(num);
  }
  bool res = 0;
  for (int i : s) {
    for (int j : s)
      if ((i & j) == 0) res = 1;
  }
  cout << (res ? "YES" : "NO");
}
