namespace AtCoder;

#nullable enable

using System.Numerics;

static class Extensions
{
    public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray();
}

class ExtendedBitMatrix
{
    public const int d = 64;
    ulong[] ML { get; init; } = new ulong[d];
    ulong[] MR { get; init; } = new ulong[d];

    static bool OfFlag(ulong x, int i) => ((x >> i) & 1) > 0;

    public ulong L(int i) => ML[i];
    public ulong R(int i) => MR[i];
    public void AddR(int i, ulong r) { MR[i] ^= r; }
    public bool L(int i, int j) => OfFlag(ML[i], j);
    public bool R(int i, int j) => OfFlag(MR[i], j);
    public void SetR(int i, int j, bool v)
    {
        var f = 1UL << j;
        if (v) MR[i] |= f; else MR[i] &= ~f;
    }

    public int Add(ulong l, ulong r)
    {
        (l, r) = Make(l, r);
        if (l == 0) return -1;
        var (ml, mr) = (ML, MR);
        for (var i = d - 1; i >= 0; i--)
        {
            if (!OfFlag(l, i)) continue;
            (ml[i], mr[i]) = (l, r);
            for (var j = 0; j < d; j++)
            {
                if (j == i || !OfFlag(ml[j], i)) continue;
                ml[j] &= l;
                mr[j] &= r;
            }
            return i;
        }
        return -1;
    }

    // try to make l with bases
    // return sum of rows on MR if possible
    public ulong? Make(ulong l)
    {
        var (nl, r) = Make(l, 0);
        return nl == 0 ? r : null;
    }

    (ulong, ulong) Make(ulong l, ulong r)
    {
        var (ml, mr) = (ML, MR);
        for (var i = d - 1; i >= 0; i--)
        {
            if (!OfFlag(l, i) || !OfFlag(ml[i], i)) continue;
            l &= ml[i];
            r &= mr[i];
        }
        return (l, r);
    }
}

class AtCoder
{
    object? Solve()
    {
        var n = Int();
        var m = Int();
        var sz = m.Repeat(() => Convert.ToUInt64(String(), 2));
        var sh = new HashSet<ulong>(sz);
        if (!sh.Contains((1UL << n) - 1)) return false;
        foreach (var s1 in sz) foreach (var s2 in sz) if (!sh.Contains(s1 & s2)) return false;
        var matrix = new ExtendedBitMatrix();
        foreach (var s in sz) matrix.Add(s, 0);
        var sss = new HashSet<ulong>();
        sss.Add(0);
        for (var i = 0; i < 64; i++)
        {
            var b = matrix.L(i);
            if (b == 0) continue;
            var nss = new HashSet<ulong>();
            foreach (var bs in sss)
            {
                nss.Add(bs);
                nss.Add(bs | b);
            }
            sss = nss;
        }
        foreach (var b in sss) if (!sh.Contains(b)) return false;
        return true;
    }

    public static void Main() => new AtCoder().Run();
    public void Run()
    {
        var res = Solve();
        if (res != null)
        {
            if (res is bool yes) res = yes ? "Yes" : "No";
            sw.WriteLine(res);
        }
        sw.Flush();
    }

    string[] input = Array.Empty<string>();
    int iter = 0;
    readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false };

    string String()
    {
        while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Trim().Split(' '), 0);
        return input[iter++];
    }
    T Input<T>() where T : IParsable<T> => T.Parse(String(), null);
    int Int() => Input<int>();
    void Out(object? x, string? separator = null)
    {
        separator ??= Environment.NewLine;
        if (x is System.Collections.IEnumerable obj and not string)
        {
            var firstLine = true;
            foreach (var item in obj)
            {
                if (!firstLine) sw.Write(separator);
                firstLine = false;
                sw.Write(item);
            }
        }
        else sw.Write(x);
        sw.WriteLine();
    }
}