The HDWBP Inc. has clients and needs to service these clients by opening facilities. Each opened facility can serve any number of clients and each client must be served by an open facility. There are potential locations for these facilities. The cost of serving client at potential location is a non-negative integer c_{ij}. These costs satisfy a locality property: for two clients and j_0 and two facilities and i_0, we have c_{ij} \leq c_{i_0 j} + c_{i_0 j_0} + c_{i j_0}. Given the costs, the CEO of HDWBP Inc. ultimately wants to know the cheapest way to open facilities and assign clients to these open facilities. For now, he needs your help to determine if it is possible to do this task without any cost (i.e. with cost zero).
The first line contains three integers , , where 1 \leq m \leq 100, 1 \leq n \leq 100 and 1 \leq k \leq m. Each of the next lines contains non-negative integers where the -th integer in the -th line is c_{ij} \leq 10000.
Display yes if it is possible to do the task with cost zero; otherwise, display no.
Example 1
Example 2