8610: Yet Another FFT Problem?

triplea and tripleb have two integer arrays A=[a₁,a₂,…,a_n] and B=[b₁,b₂,…,b_m], respectively. One day they came up with the following problem:

• Does there exists a pair of numbers in arrays A and B, such that their absolute difference is the same?

However, triplea and tripleb care about their data privacy, so they don't want to expose their array directly to each other. That's why they turn to you------triplec. Can you help them solve this problem?

Formally, you need to determine: do there exist four indices 1≤i,j≤n,1≤k,l≤m, such that i≠j, k≠l and |a_i-a_j|=|b_k-b_l|.

The first line contains two integers n,m(2≤n,m≤10⁶), denoting the sizes of array $A$ and $B$, respectively.
The next line contains n integers a₁,a₂,…,a_n(0≤a_i≤10⁷), denoting the elements of array $A$.
The next line contains m integers b₁,b₂,…,b_m(0≤b_i≤10⁷), denoting the elements of array $B$.

If there exist four indices 1≤i,j≤n,1≤k,l≤m, such that i≠j, k≠l and |a_i-a_j|=|b_k-b_l|, output i,j,k,l in a line, otherwise output $-1$ in a line.