B'Simon loves neatness. So before he goes to bed, Simon wants to complete all chores in the house. Simon 's house looks like a rectangular table consisting of n rows and n columns from above. All rows of the table are numbered from 1 to n from top to bottom. All columns of the table are numbered from 1 to n from left to right. Each cell of the table is a room. Pair (x, xe2 x80 x89y) denotes the room, located at the intersection of the x-th row and the y-th column. For each room we know if the light is on or not there. Initially Simon is in room (x0, xe2 x80 x89y0). He wants to turn off the lights in all the rooms in the house, and then return to room (x0, xe2 x80 x89y0). Suppose that at the current moment Simon is in the room (x, xe2 x80 x89y). To reach the desired result, he can perform the following steps: Help Simon, find the sequence of actions that lets him achieve the desired result. The first line contains three positive integers n, xe2 x80 x89x0, xe2 x80 x89y0 (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89500, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89x0, xe2 x80 x89y0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n). Next n lines contain the description of rooms in the house. The i-th line contains n space-separated integers ai1, xe2 x80 x89ai2, xe2 x80 x89..., xe2 x80 x89ain. If number aij equals zero, then room (i, xe2 x80 x89j) has light off, and if number aij equals one, then room (i, xe2 x80 x89j) has light on. It is guaranteed that at least one room has light on. If there is no desired sequence of actions, print "NO" (without the quotes). Otherwise, print "YES" (without the quotes) and the description of the required sequence of actions as a string. Note that you do not have to minimize the length of the sequence of actions but you shouldn 't use more than 3 xc2 xb7106 actions.'...