CodeForces - 777C

During 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_ito 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.

题意：给你一个二维数组问你从L行到R行是否存在着一列是非递减数列，如果有输出 Yes 否则 No

题解：其实可以先都记录下来每一行非递减能到的的最大行，之后直接查找就行，形成一个新的，记录可以到的最大行，用b[i],记录每行能够到达的最大行，  之后查找比较即可

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector> 
using namespace std;
const int MAX = 1e5+10;
int b[MAX];
vector<int >a[MAX]; //这里需要用到vector ，否则会因为数组大小过大或者过小而CE或者RE
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int temp;
        for(int i=1;i<=n;i++)
        { 
            a[i].push_back(0);
            for(int j=1;j<=m;j++)
            {
                scanf("%d",&temp);
                a[i].push_back(temp);
            }
        }//将矩阵存入数组
        for(int j=1;j<=m;j++)
        {
            for(int i=1;i<n;)
            {
                if(a[i+1][j]>=a[i][j])//需要对最后一行特判 
                {
                    int flag=i;
                    while(flag<n&&a[flag+1][j]>=a[flag][j])
                        flag++;//找最大行
                    for(int k=i;k<flag;k++)
                        a[k][j]=flag;
                    i=flag;//把这一列先找完，再找下一列
                }
                else
                {
                    a[i][j]=i;
                    i++;
                }
            }
        }

        b[n]=n;//对最后一行的特判 
        for(int i=1; i<n; i++)
        {
            int Max=a[i][1];
            for(int j=2; j<=m; j++)
                Max=max(Max,a[i][j]);
            b[i]=Max;
        }

        int q;
        scanf("%d",&q);
        while(q--)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            if(b[u]>=v)
                printf("Yes\n");
            else printf("No\n");
        }

    }
    return 0;
}