cf 777c Alyona and Spreadsheet

C. Alyona and Spreadsheet

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ai, 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 ai, j ≤ ai + 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 ai, j ≤ ai + 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 ai, j (1 ≤ ai, j ≤ 109).

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 li and ri (1 ≤ li ≤ ri ≤ n).

Output

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

Example

input

5 41 2 3 53 1 3 24 5 2 35 5 3 24 4 3 461 12 54 53 51 31 5

output

YesNoYesYesYesNo

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.

思路：用vector来存图，用chang【i】来记录以i为起点的最长非下降子序列的长度，然后遍历m条链来更新chang【i】数组，最后只需比较起点加上它的长度与终点的大小即可。

#include<iostream>#include<bits/stdc++.h>#include<algorithm>using namespace std;typedef unsigned long long int ll;vector<ll>a[112345];ll chang[112345];int main(){    ll n,m,x,left,right;    while(cin>>n>>m)    {        for(ll i=0;i<=n;i++) chang[i]=1;        for(ll i=0;i<=n;i++) a[i].clear();        for(ll i=1;i<=n;i++)        {            for(ll j=1;j<=m;j++)            {                scanf("%llu",&x);                a[j].push_back(x);            }        }        ll mm=1;        for(ll i=1;i<=m;i++)        {            ll st=a[i][0],ma=1,ji=0;            for(ll j=1;j<n;j++)            {                if(a[i][j]>=st)                {                    ma++;                    st=a[i][j];                    if(j==n-1)                    {                        chang[ji]=max(chang[j],ma);                        ji=j;                        ma=1;                        st=a[i][j];                    }                }                else                {                    chang[ji]=max(chang[ji],ma);                    ji=j;                    ma=1;                    st=a[i][j];                }            }        }        for(ll i=1;i<n;i++) chang[i]=max(chang[i],chang[i-1]-1);        ll k; cin>>k;        while(k--)        {            scanf("%llu%llu",&left,&right);            left--;            right--;            if(left+chang[left]-1>=right) printf("Yes\n");            else printf("No\n");        }    }    return 0;}