#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MM = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 2e6 + 10;

int n, m;

void prework(){

}

void read(){

}

int a[1111];
int x;

int check(){
	set<int> x;
	x.insert(0);
	int now = 0;
	for (int i = 1; i <= n; i++){
		now += a[i];
		if (x.find(now - 777) != x.end())
			return 1;
		x.insert(now);
	}
	return 0;
}

void solve(int casi){
//	cout << "Case #" << casi << ": ";
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		a[i] = 0;
	int flag = 0;
	for (int i = 1; i <= m; i++){
		for (int j = 1; j <= n; j++){
			cin >> x;
			a[j] += x;
		}
		flag |= check();
	}
	cout << (flag ? "YES" : "NO") << endl;
}

void printans(){

}


int main(){
	std::ios::sync_with_stdio(false);
	prework();
	int T = 1;
//	cin>>T;
	for(int i = 1; i <= T; i++){
		read();
		solve(i);
		printans();
	}
	return 0;
}