Alyona and Spreadsheet

uring the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables.

Now she has a table filled with integers. The table consists of n rows and m columns. By a_i, j we will denote the integer located at the i-th row and the j-th column. We say that the table is sorted in non-decreasing order in the column j if a_i, j ≤ a_{i + 1, j} for all i from 1 to n - 1.

Teacher gave Alyona k tasks. For each of the tasks two integers l and r are given and Alyona has to answer the following question: if one keeps the rows from l to r inclusive and deletes all others, will the table be sorted in non-decreasing order in at least one column? Formally, does there exist such j that a_i, j ≤ a_{i + 1, j} for all i from l to r - 1 inclusive.

Alyona is too small to deal with this task and asks you to help!

Input

The first line of the input contains two positive integers n and m (1 ≤ n·m ≤ 100 000) — the number of rows and the number of columns in the table respectively. Note that your are given a constraint that bound the product of these two integers, i.e. the number of elements in the table.

Each of the following n lines contains m integers. The j-th integers in the i of these lines stands for a_i, j (1 ≤ a_i, j ≤ 10⁹).

The next line of the input contains an integer k (1 ≤ k ≤ 100 000) — the number of task that teacher gave to Alyona.

The i-th of the next k lines contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n).

Output

Print "Yes" to the i-th line of the output if the table consisting of rows from l_i to r_i inclusive is sorted in non-decreasing order in at least one column. Otherwise, print "No".

Example

Input

5 4
1 2 3 5
3 1 3 2
4 5 2 3
5 5 3 2
4 4 3 4
6
1 1
2 5
4 5
3 5
1 3
1 5

Output

Yes
No
Yes
Yes
Yes
No

Note

In the sample, the whole table is not sorted in any column. However, rows 1–3 are sorted in column 1, while rows 4–5 are sorted in column 3.

题意：求一个n*m的矩阵中l行到r行中是否存在非递减数列。如果直接用二维数组做会超内存。
所以就用了三个数组来做，一个保存上一行的数，一个保存当前列能非递增到达的最上面的行数，
另一个数组保存该行所有列中能非递增到达的最大行数。让后进行判断的时候，只要从c[r] < l，
输出Yes,否则是No。开始还以为不是递减数列的就是非递增数列。这个是错误的。
注意：非递减数列，是指前一项小于等于后一项。            递减数列，是指前一项小于后一项。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int maxn = 1e5 + 5;

int main()
{
    int n,m;
    int i,j;
    int a[maxn],b[maxn],c[maxn];
    memset(a,0,sizeof(a));
    while(scanf("%d%d",&n,&m) != EOF)
    {
        int x;
        for(i = 1;i <= n;i++)
        {
            c[i] = i;
            for(j = 1;j <= m;j++)
            {
                scanf("%d",&x);
                if(x < a[j]) b[j] = i;
                a[j] = x;
                if(c[i] > b[j])
                {
                    c[i] = b[j];
                }
            }
        }
        int k,l,r;
        scanf("%d",&k);
        while(k--)
        {
            scanf("%d%d",&l,&r);
            if(c[r] <= l) printf("Yes\n");
            else printf("No\n");
        }
    }
    return 0;
}