Codeforces Round #401 (Div. 2)C. 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 ton - 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 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.

题意：给你一个矩阵，然后k次询问，每次询问有两个数l，r，问在l到r行存不存在一列是非递减的，存在yes否则no。

思路：很简单的dp打表后O（1）询问，打表记录每个位置前面符合条件的长度就好了，然后他没给确切的n*m，本来想用动态分配空间的，后来想了下用vector比较方便就这么弄了。难度不大，下面给代码：

#include<iostream>  
#include<cmath>  
#include<queue>  
#include<cstdio>  
#include<queue>  
#include<algorithm>  
#include<cstring>  
#include<string>  
#include<utility>
#include<map>
#include<vector>
#define maxn 100005
#define inf 0x3f3f3f3f
using namespace std;
typedef long long LL;
const double eps = 1e-5;
vector<int>v[maxn], vv[maxn];
int ans[maxn];
int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++){
		for (int j = 0; j < m; j++){
			int x;
			scanf("%d", &x);
			v[i].push_back(x);
		}
	}
	for (int i = 1; i <= n; i++)
		ans[i] = 1;
	for (int i = 0; i < m; i++)
		vv[1].push_back(1);
	for (int i = 0; i < m; i++){
		for (int j = 2; j <= n; j++){
			if (v[j][i] >= v[j - 1][i]){
				vv[j].push_back(vv[j - 1][i] + 1);
				ans[j] = max(ans[j], vv[j][i]);
			}
			else
				vv[j].push_back(1);
		}
	}
	int k;
	scanf("%d", &k);
	while (k--){
		int l, r;
		scanf("%d%d", &l, &r);
		if (r - l + 1>ans[r])
			printf("No\n");
		else
			printf("Yes\n");
	}
}