#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// const ll INF = numeric_limits<ll>::max() / 4;
// const int INF = numeric_limits<int>::max() / 4;
// cout << std::fixed << std::setprecision(15);



void MakeXORBasis(vector<int>& A, vector<int>& B){
}

int main() {
	int N, M;
	cin >> N >> M;
	if(N == 1){
		cout << "Yes" << endl;
		return 0;
	}
	vector<string> S(M);
	for(int i = 0; i < M; i++) cin >> S[i];
	int K = (N / 64) + 1;
	vector X(M, vector<ull>(K, 0));
	for(int i = 0; i < M; i++){
		for(int k = 0; k < K; k++){
			for(int b = 0; k * 64 + b < N; b++){
				if(S[i][k * 64 + b] == '1') X[i][k] += (1ULL << b);
			}
		}
	}

	vector<vector<ull> > Y;
	for(int i = 0; i < M; i++){
		vector<ull> a = X[i];
		for(auto it = Y.begin(); it != Y.end(); it++){
			vector<ull> b = *it;
			int f = 0;
			for(int k = 0; k < K; k++){
				if(f == -1){
					a[k] = a[k];
				}else if(f == 1){
					a[k] = a[k] ^ b[k];
				}else{
					if(a[k] < a[k] ^ b[k]){
						a[k] = a[k];
						f = -1;
					}else if(a[k] > a[k] ^ b[k]){
						a[k] = a[k] ^ b[k];
						f = 1;
					}
				}
			}
		}
		bool f = false;
		for(int k = 0; k < K; k++) if(a[k] != 0) f = true;
		if(f) Y.push_back(a);
		if(N <= Y.size()) break;
	}
	if(N <= Y.size()){
		cout << "Yes" << endl;
	}else{
		cout << "No" << endl;
	}
	return 0;
}