
# Problem:

Given $n$ sets of integers $S_1,\ldots,S_n$, find two integers $a,b$ and two indices $i,j$ such that $a,b\in S_i\cap S_j$.

# Input:

The first line contains a single integer $n$, the number of sets of integers. $1\leq n\leq 50000$
The next $n$ lines describe sets $S_1$ through $S_n$ in order.
Line $i$ starts with an integer $k_i=|S_i|$, then space separated follow $k_i$ distinct integers, the elements of $S_i$.
The sum of $|S_i|$ over all $i$ is at most $50000$ and each element $x$ of a set $S_i$ obeys $1\leq x\leq 10^9$.

# Output:

Output four integers $a,b,i,j$ in order with $1\leq i\leq n$, $1\leq j\leq n$ for which $a,b\in S_i\cap S_j$ and $a\neq b$ and $i\neq j$.
Any such integers suffices. If no such integers exist, output "no".
