B"Dima is a good person. In fact, he's great. But all good things come to an end... Seryozha is going to kick Dima just few times.. For this reason he divides the room into unit squares. Now the room is a rectangle n xe2 x80 x89 xc3 x97 xe2 x80 x89m consisting of unit squares. For the beginning, Seryozha put Dima in a center of some square. Then he started to kick Dima (it is known, that he kicks Dima at least once). Each time when Dima is kicked he flyes up and moves into one of four directions (up, left, right, down). On each move Dima passes k (k xe2 x80 x89> xe2 x80 x891) unit of the length in the corresponding direction. Seryozha is really kind, so he kicks Dima in such way that Dima never meets the walls (in other words, Dima never leave the room's space). Seryozha is also dynamic character so Dima never flies above the same segment, connecting a pair of adjacent squares, twice. Seryozha kicks Dima for a long time, but Dima is not vindictive -- Dima writes. Dima marked all squares in which he was staying or above which he was flying. Thanks to kicks, Dima does not remember the k value, so he asks you to find all possible values which matches to the Dima's records. The first line contains n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89103) -- size of the room. Next n lines goes, each contains m numbers aij -- Dima's notes: aij xe2 x80 x89= xe2 x80 x891, if Dima was staying in the square (i, xe2 x80 x89j) or was flying above it. Otherwise aij xe2 x80 x89= xe2 x80 x890. At least one aij equals 1. In a single line in accending order print all k (k xe2 x80 x89> xe2 x80 x891), which matches the Dima's notes. If there are no such k and Dima invented this story with kicks, print -1."...