AtCoder Inc. is planning to develop a product. The product has $K$ parameters, whose values are currently all zero. The company aims to raise all parameter values to at least $P$.
There are $N$ development plans. Executing the $i$\-th development plan ($1 \le i \le N$) increases the value of the $j$\-th parameter by $A_{i,j}$ for every integer $j$ such that $1 \le j \le K$, at the cost of $C_i$.
A development plan cannot be executed more than once. Determine whether the company can achieve its goal, and if it can, find the minimum total cost required to achieve the goal.
## Constraints
* $1 \le N \le 100$
* $1 \le K,P \le 5$
* $0 \le A_{i,j} \le P(1 \le i \le N,1 \le j \le K)$
* $1 \le C_i \le 10^9(1 \le i \le N)$
* All input values are integers.
## Input
The input is given from Standard Input in the following format:
$N$ $K$ $P$
$C_1$ $A_{1,1}$ $A_{1,2}$ $\dots$ $A_{1,K}$
$C_2$ $A_{2,1}$ $A_{2,2}$ $\dots$ $A_{2,K}$
$\dots$
$C_N$ $A_{N,1}$ $A_{N,2}$ $\dots$ $A_{N,K}$
[samples]