codeforces C. Equal Sums使用map区间。

C. Equal Sums

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given kk sequences of integers. The length of the ii-th sequence equals to nini.

You have to choose exactly two sequences ii and jj (i≠ji≠j) such that you can remove exactly one element in each of them in such a way that the sum of the changed sequence ii (its length will be equal to ni−1ni−1) equals to the sum of the changed sequence jj (its length will be equal to nj−1nj−1).

Note that it's required to remove exactly one element in each of the two chosen sequences.

Assume that the sum of the empty (of the length equals 00) sequence is 00.

Input

The first line contains an integer kk (2≤k≤2⋅1052≤k≤2⋅105) — the number of sequences.

Then kk pairs of lines follow, each pair containing a sequence.

The first line in the ii-th pair contains one integer nini (1≤ni<2⋅1051≤ni<2⋅105) — the length of the ii-th sequence. The second line of the ii-th pair contains a sequence of nini integers ai,1,ai,2,…,ai,niai,1,ai,2,…,ai,ni.

The elements of sequences are integer numbers from −104−104 to 104104.

The sum of lengths of all given sequences don't exceed 2⋅1052⋅105, i.e. n1+n2+⋯+nk≤2⋅105n1+n2+⋯+nk≤2⋅105.

Output

If it is impossible to choose two sequences such that they satisfy given conditions, print "NO" (without quotes). Otherwise in the first line print "YES" (without quotes), in the second line — two integers ii, xx (1≤i≤k,1≤x≤ni1≤i≤k,1≤x≤ni), in the third line — two integers jj, yy (1≤j≤k,1≤y≤nj1≤j≤k,1≤y≤nj). It means that the sum of the elements of the ii-th sequence without the element with index xx equals to the sum of the elements of the jj-th sequence without the element with index yy.

Two chosen sequences must be distinct, i.e. i≠ji≠j. You can print them in any order.

If there are multiple possible answers, print any of them.

Examples

input

Copy

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

output

Copy

YES
2 6
1 2

input

Copy

3
1
5
5
1 1 1 1 1
2
2 3

output

Copy

NO

input

Copy

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

output

Copy

YES
2 2
4 1

Note

In the first example there are two sequences [2,3,1,3,2][2,3,1,3,2] and [1,1,2,2,2,1][1,1,2,2,2,1]. You can remove the second element from the first sequence to get [2,1,3,2][2,1,3,2] and you can remove the sixth element from the second sequence to get [1,1,2,2,2][1,1,2,2,2]. The sums of the both resulting sequences equal to 88

, i.e. the sums are equal

这道题的大意就是说，在t组数中取出两组，然后使得这两组数，每组数去掉一个数，两组数的剩余部分和相等.，然后输出第几组数删除该组数的第几个数。

这里使用了pair<int,int>m结构体，使用其特性 .first .sceond分别记录第几组数，第几个数。使用map中的count来判断是否存在这样的数。然后输出就可以了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>

using namespace std;
typedef long long ll;
const ll maxn=2e5+100;
int t;
map<ll,pair<ll,ll> >m;
int a[maxn];
int n;
int main()
{
	ios::sync_with_stdio(false);
	cin>>t;
	int flag = 0;
	for(int i = 1; i <= t; i++){
		cin >> n;
		ll sum = 0;
		for(int j = 1; j <= n; j++){
			cin >> a[j];
			sum += a[j];
		}
		
		for(int k = 1; k <= n; k++){
			if(m.count(sum-a[k])){
				flag = 1;
				cout << "YES" << endl;
				cout << m[sum-a[k]].first << " " << m[sum-a[k]].second << endl;
				cout << i << " " << k << endl;
				break;
			}
		}
		if(flag == 1) break;
		for(int j = 1; j <= n; j++){
			m[sum-a[j]] = {i,j};
		}
	}
	if(flag==0) cout << "NO" << endl;
 	return 0;
}