AT_arc219_a [ARC219A] Similarity

You are given $ N $ distinct strings $ S_1, \dots, S_N $ . Each of these strings is a string of length $ M $ consisting of `0` and `1`. Determine whether there exists a string $ T $ of length $ M $ consisting of `0` and `1` satisfying the following condition, and if so, construct one example. - Every string $ S_i $ matches $ T $ in at least one position. - More formally, for every integer $ i $ ( $ 1 \le i \le N $ ), there exists an integer $ x_i $ ( $ 1 \le x_i \le M $ ) such that the $ x_i $ -th character of $ S_i $ and the $ x_i $ -th character of $ T $ are the same.

The input is given from Standard Input in the following format: > $ N $ $ M $ $ S_1 $ $ \vdots $ $ S_N $

If no $ T $ satisfying the condition in the problem statement exists, output `No`. If a $ T $ satisfying the condition in the problem statement exists, output in the following format: > Yes $ T $ If multiple $ T $ satisfying the condition exist, any of them will be accepted.

### Sample Explanation 1 If we set $ T $ to `101`, the following holds: - The $ 2 $ nd character of $ S_1 $ and the $ 2 $ nd character of $ T $ are the same. - The $ 1 $ st character of $ S_2 $ and the $ 1 $ st character of $ T $ are the same. - The $ 1 $ st character of $ S_3 $ and the $ 1 $ st character of $ T $ are the same. - The $ 2 $ nd character of $ S_4 $ and the $ 2 $ nd character of $ T $ are the same. - The $ 3 $ rd character of $ S_5 $ and the $ 3 $ rd character of $ T $ are the same. ### Sample Explanation 2 No $ T $ satisfies the condition. ### Constraints - $ N $ and $ M $ are integers. - $ 1 \leq N \leq 2 \times 10^4 $ - $ 1 \leq M \leq 100 $ - $ S_i $ is a string of length $ M $ consisting of `0` and `1`. - $ S_1, \dots, S_N $ are distinct.