CF988C.Equal Sums

You are given $k$ sequences of integers. The length of the $i$-th sequence equals to $n_i$.

You have to choose exactly two sequences $i$ and $j$ ($i \ne j$) such that you can remove exactly one element in each of them in such a way that the sum of the changed sequence $i$ (its length will be equal to $n_i - 1$) equals to the sum of the changed sequence $j$ (its length will be equal to $n_j - 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 $0$) sequence is $0$.

给你 $k$ 个整数序列。第 $i$ 个序列的长度为 $n_i$。

你需要恰好选择两个不同的序列 $i$ 和 $j$（即 $i \ne j$），使得你能在每个序列中恰好移除一个元素，从而使修改后的序列 $i$（其长度变为 $n_i - 1$）的元素和等于修改后的序列 $j$（其长度变为 $n_j - 1$）的元素和。

注意：必须在所选的两个序列中各自恰好移除一个元素。

规定：空序列（长度为 $0$ 的序列）的元素和为 $0$。

The first line contains an integer $k$ ($2 \le k \le 2 \cdot 10^5$) — the number of sequences.

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

The first line in the $i$-th pair contains one integer $n_i$ ($1 \le n_i \lt 2 \cdot 10^5$) — the length of the $i$-th sequence. The second line of the $i$-th pair contains a sequence of $n_i$ integers $a_{i, 1}, a_{i, 2}, \dots, a_{i, n_i}$.

The elements of sequences are integer numbers from $-10^4$ to $10^4$.

The sum of lengths of all given sequences don't exceed $2 \cdot 10^5$, i.e. $n_1 + n_2 + \dots + n_k \le 2 \cdot 10^5$.

第一行包含一个整数 $k$（$2 \le k \le 2 \cdot 10^5$）—— 序列的个数。

接下来是 $k$ 对行，每对行表示一个序列。

第 $i$ 对行中，第一行包含一个整数 $n_i$（$1 \le n_i \lt 2 \cdot 10^5$）—— 第 $i$ 个序列的长度；第二行包含 $n_i$ 个整数 $a_{i, 1}, a_{i, 2}, \dots, a_{i, n_i}$，即该序列的元素。

序列中的元素均为介于 $-10^4$ 到 $10^4$ 之间的整数。

所有给定序列的长度之和不超过 $2 \cdot 10^5$，即 $n_1 + n_2 + \dots + n_k \le 2 \cdot 10^5$。

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 $i$, $x$ ($1 \le i \le k, 1 \le x \le n_i$), in the third line — two integers $j$, $y$ ($1 \le j \le k, 1 \le y \le n_j$). It means that the sum of the elements of the $i$-th sequence without the element with index $x$ equals to the sum of the elements of the $j$-th sequence without the element with index $y$.

Two chosen sequences must be distinct, i.e. $i \ne j$. You can print them in any order.

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

如果无法选择两个满足给定条件的序列，则输出 "NO"（不带引号）。否则，第一行输出 "YES"（不带引号）；第二行输出两个整数 $i$、$x$（$1 \le i \le k,\ 1 \le x \le n_i$）；第三行输出两个整数 $j$、$y$（$1 \le j \le k,\ 1 \le y \le n_j$）。这表示：第 $i$ 个序列去掉下标为 $x$ 的元素后的元素之和，等于第 $j$ 个序列去掉下标为 $y$ 的元素后的元素之和。

所选的两个序列必须互不相同，即 $i \ne j$。你可以以任意顺序输出它们。

若存在多个可能的答案，输出任意一个即可。

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

在第一个例子中，有两个序列 $[2, 3, 1, 3, 2]$ 和 $[1, 1, 2, 2, 2, 1]$。你可以从第一个序列中删除第二个元素，得到 $[2, 1, 3, 2]$；也可以从第二个序列中删除第六个元素，得到 $[1, 1, 2, 2, 2]$。这两个新序列的和均为 $8$，即它们的和相等。