#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(m);
	vector<int>b(1 << n);
	rep(i, m) {
		string s; cin >> s;
		int x = 0;
		rep(j, n)x |= (s[j] - '0') << j;
		a[i] = x;
		b[a[i]] = true;
	}
	if (!b[0] || !b[(1 << n) - 1]) {
		cout << "No" << endl;
		return 0;
	}
	bool chk = true;
	rep(i, m)rep(j, m) {
		if (!b[a[i] | a[j]])chk = false;
		if (!b[a[i] & a[j]])chk = false;
	}
	cout << (chk ? "Yes" : "No") << endl;
	return 0;
}