#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

void solve() {
	int n, m;
	cin >> m >> n;
	auto decode = [&](string s) {
		int res = 0;
		for (char c : s) res = res * 2 + c - '0';
		return res;
	};
	vector<int> s(n);
	rep(i, 0, n) {
		string t;
		cin >> t;
		s[i] = decode(t);
	}
	sort(s.begin(), s.end());
	if (s[0] == 0) {
		cout << "No\n";
		return;
	}
	set<int> st{s.begin(), s.end()};
	int al = (1 << m) - 1;
	for (int bit : s) {
		al &= bit;
		rep(i, 0, m) if ((~bit >> i) & 1) {
			if (!st.count(bit ^ (1 << i))) {
				cout << "No\n";
				return;
			}
		}
	}
	if (al == s[0]) cout << "Yes\n";
	else cout << "No\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}