{"raw_statement":[{"iden":"problem statement","content":"We have an $H$\\-by-$W$ matrix. Let $a_{ij}$ be the element at the $i$\\-th row from the top and $j$\\-th column from the left. In this matrix, each $a_{ij}$ is a lowercase English letter.\nSnuke is creating another $H$\\-by-$W$ matrix, $A'$, by freely rearranging the elements in $A$. Here, he wants to satisfy the following condition:\n\n*   Every row and column in $A'$ can be read as a palindrome.\n\nDetermine whether he can create a matrix satisfying the condition."},{"iden":"note","content":"A _palindrome_ is a string that reads the same forward and backward. For example, `a`, `aa`, `abba` and `abcba` are all palindromes, while `ab`, `abab` and `abcda` are not."},{"iden":"constraints","content":"*   $1 ≤ H, W ≤ 100$\n*   $a_{ij}$ is a lowercase English letter."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$H$ $W$\n$a_{11}$$a_{12}$$...$$a_{1W}$\n$:$\n$a_{H1}$$a_{H2}$$...$$a_{HW}$"},{"iden":"sample input 1","content":"3 4\naabb\naabb\naacc"},{"iden":"sample output 1","content":"Yes\n\nFor example, the following matrix satisfies the condition.\n\nabba\nacca\nabba"},{"iden":"sample input 2","content":"2 2\naa\nbb"},{"iden":"sample output 2","content":"No\n\nIt is not possible to create a matrix satisfying the condition, no matter how we rearrange the elements in $A$."},{"iden":"sample input 3","content":"5 1\nt\nw\ne\ne\nt"},{"iden":"sample output 3","content":"Yes\n\nFor example, the following matrix satisfies the condition.\n\nt\ne\nw\ne\nt"},{"iden":"sample input 4","content":"2 5\nabxba\nabyba"},{"iden":"sample output 4","content":"No"},{"iden":"sample input 5","content":"1 1\nz"},{"iden":"sample output 5","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}