AT_abc454_b [ABC454B] Mapping

There are $ N $ people numbered $ 1 $ through $ N $ . There are $ M $ types of clothes numbered $ 1 $ through $ M $ . Person $ i $ is wearing clothes $ F_i $ . Answer the following two questions with Yes or No. - Question $ 1 $ : Are all $ N $ people wearing different types of clothes? - Question $ 2 $ : For every one of the $ M $ types of clothes, is there at least one person wearing that type?

The input is given from Standard Input in the following format: > $ N $ $ M $ $ F_1 $ $ F_2 $ $ \dots $ $ F_N $

Output two lines. The $ i $ -th line should contain `Yes` if the answer to question $ i $ is Yes, and `No` if it is No.

### Sample Explanation 1 Everyone is wearing a different type of clothes, so the answer to question $ 1 $ is Yes. There is no person wearing clothes $ 3 $ , so the answer to question $ 2 $ is No. ### Constraints - $ 1 \leq N \leq 100 $ - $ 1 \leq M \leq 100 $ - $ 1 \leq F_i \leq M $ - All input values are integers.