Strings $S$ and $T$ is given. Find a longest common substring of $S$ and $T$.

$S$
$T$

Output $a,b,c,d$ when a longest common substring can be taken as $(S_a, \ldots, S_{b-1})$ and $(T_c, \ldots, T_{d-1})$. $a$ $b$ $c$ $d$ Here, $S_i$ represents the $(1+i)$-th character of $S$, and $T_j$ represents the $(j+1)$-th character of $T$. If the longest common substring is empty, print: $0$ $0$ $0$ $0$

- $1 \leq |S|, |T| \leq 5\times 10^{5}$
- Each character of $S$, $T$ is lowercase English letters.

0 3 0 3

`3 6 4 7` is also accepted.

Yosupo.