Given an \(n\) by \(m\) two dimensional \(2D\) grid containing positive integers values, you have to answer \(Q\) queries.

In the \(i^{th}\) query, you will be given the row and column of a start cell, \((x_{1}, y_{1})\), and the row and column of an end cell, \((x_{2}, y_{2})\). It is guaranteed that \(x_{1} <= x_{2}\), and \(y_{1} <= y_{2}\). For each query, you should return the Bitwise OR of the values in all cells \((i, j)\) satisfying the condition \(x_{1} <= i <= x_{2}\), and \(y_{1} <= j <= y_{2}\).

INPUT FORMAT

The first line contains two integers \(n\) \((1 <= n <= 10^3)\), and \(m\) \((1 <= m <= 10^3)\) - denoting the number of rows and columns in the grid.

The \(i^{th}\) line among the next \(n\) lines each contains \(m\) integers, \(a_{i, 1}, a_{i, 2}, a_{i, 3}, ..., a_{i, m}\) \((1 <= a_{i, j} < 2^{30})\).

The next line contains an integer \(Q\) (\(1 <= Q <= 10^5\)) - denoting the number of queries.

The remaining \(Q\) lines each contain \(4\) integers \(x_{1}, y_{1}, x_{2}, y_{2}\) (\(1 <= x_{1}, x_{2} <= n\), \(1 <= y_{1}, y_{2} <= m\), \(x_{1} <= x_{2}, \) \(y_{1} <= y_{2}\)) - denoting the coordinates of the start and end cell, respectively.

OUTPUT FORMAT

The output should contain \(Q\) lines, the \(i^{th}\) of them should be the answer to the \(i^{th}\) query.