#include<stdio.h>
int h[100005], l;
int comp_h(int a, int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(int a, int b)
{
	int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(int ne)
{
	h[l] = ne;
	int p = l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
int pop()
{
	swap_h(0, --l);
	int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
char s[22];
int a[100005];
int v[100005];
int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	int i, j;
	for (i = 0; i < m; i++)
	{
		scanf("%s", s);
		a[i] = 0;
		for (j = 0; j < n; j++)
			a[i] = 2 * a[i] + s[j] - '0';
	}
	l = 0;
	for (i = 0; i < m; i++)
		push(a[i]);
	for (i = 0; i < m; i++)
		a[i] = pop();
	if (a[0] == 0)
	{
		printf("No\n");
		return 0;
	}
	for (i = 0; i < m; i++)
		v[i] = 0;
	int min, mid, max, f;
	a[m] = -1;
	for (i = 0; i < m; i++)
	{
		for (j = 0; j < n; j++)
		{
			if (((a[i] >> j) & 1) > 0)
				continue;
			f = (a[i] | (1 << j));
			min = -1;
			max = m;
			while (max - min > 1)
			{
				mid = (max + min) / 2;
				if (a[mid] < f)
					min = mid;
				else
					max = mid;
			}
			if (a[max] != f)
			{
				printf("No\n");
				return 0;
			}
			v[max]++;
		}
	}
	for (i = 1; i < m; i++)
	{
		if (v[i] == 0)
		{
			printf("No\n");
			return 0;
		}
	}
	printf("Yes\n");
	return 0;
}