Exercise — Eolymp

Input

The first line contains two integers, $n$ and $m$ ( $1 \leq n \leq 10$ 1 \leq n \leq 10, $1 \leq m \leq 10$ 1 \leq m \leq 10). The next $n$ lines each contain $m + 1$ m+1 integers, representing the coefficients $a_{i, 1}$ a_{i,1}, $a_{i, 2}$ a_{i,2}, $\dots$ , $a_{i, m}$ a_{i,m} and the constant term $b_{i}$ b_i ( $- 100 \leq a_{i, j} \leq 100$ -100 \leq a_{i,j} \leq 100, $- 100 \leq b_{i} \leq 100$ -100 \leq b_i \leq 100).

Output

If there is no solution, output "NO" on a single line. If a solution exists, output "YES" on the first line. On the second line, provide $m$ numbers, which are the values of $x_{1}$ x_1, $x_{2}$ x_2, $\dots$ , $x_{m}$ x_m, such that all equations in the system hold true. The numbers should be presented with a precision of at least $1 0^{- 9}$ 10^{-9}.

Examples

Example 1

Loading