A9224. Dima and Kicks
编程题
普及/提高-
知识点
题目描述
The first line contains $n$ and $m$ $(1<=n,m<=10^{3})$ — size of the room.
Next $n$ lines goes, each contains $m$ numbers $a_{ij}$ — Dima's notes: $a_{ij}=1$ , if Dima was staying in the square $(i,j)$ or was flying above it. Otherwise $a_{ij}=0$ .
At least one $a_{ij}$ equals $1$ .
Next $n$ lines goes, each contains $m$ numbers $a_{ij}$ — Dima's notes: $a_{ij}=1$ , if Dima was staying in the square $(i,j)$ or was flying above it. Otherwise $a_{ij}=0$ .
At least one $a_{ij}$ equals $1$ .
输入格式
In a single line in accending order print all $k$ $(k>1)$ , which matches the Dima's notes. If there are no such $k$ and Dima invented this story with kicks, print - $1$ .
输出格式
无
输入输出样例
输入 #1
5 5 1 1 1 1 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 1 1 1 1
输出 #1
2 4
输入 #2
7 7 0 0 1 1 1 0 0 0 0 1 0 1 0 0 1 1 1 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 1 0 0 1 0 1 0 0 0 0 1 1 1 0 0
输出 #2
2
输入 #3
3 3 1 1 1 1 1 1 1 1 1
输出 #3
-1
输入 #4
4 4 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0
输出 #4
3
输入 #5
5 5 0 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 1 0 0 0 0 1 0 0
输出 #5
-1