CF868C.Qualification Rounds

Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.

k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.

Determine if Snark and Philip can make an interesting problemset!

斯纳克和菲利普正在为即将到来的半四分之一决赛预选赛准备题目集。他们有一个包含 $n$ 道题的题库，希望从中选出一个非空子集作为本次比赛的题目集。

共有 $k$ 支经验丰富的队伍参加本次比赛。其中一些队伍已经掌握了部分题目。为了使比赛对他们保持趣味性，要求每支队伍所掌握的题目数量至多为所选题目集大小的一半。

请判断斯纳克和菲利普能否构造出一个满足上述条件的有趣题目集！

The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.

Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.

第一行包含两个整数 $n$、$k$（$1 \leq n \leq 10^5$，$1 \leq k \leq 4$）—— 分别表示题目数量和有经验的队伍数量。

接下来的 $n$ 行中，每行包含 $k$ 个整数，每个数为 $0$ 或 $1$。第 $i$ 行中的第 $j$ 个数为 $1$ 表示第 $j$ 支队伍掌握了第 $i$ 道题目，为 $0$ 则表示不掌握。

Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.

You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").

如果可以构造出一个有趣的题目集，则输出 "YES"（引号仅用于明确显示），否则输出 "NO"。

每个字符均可使用大写或小写形式（当答案为 "YES" 时，"YeS" 和 "yes" 均为有效输出）。

In the first example you can't make any interesting problemset, because the first team knows all problems.

In the second example you can choose the first and the third problems.

在第一个例子中，你无法构造出任何有趣的题目集，因为第一支队伍掌握了所有题目。

在第二个例子中，你可以选择第一题和第三题。