DZY loves strings, and he enjoys collecting them.

In China, many people like to use strings containing their names' initials, for example: xyz, jcvb, dzy, dyh.

Once DZY found a lucky string $*s*$. A lot of pairs of good friends came to DZY when they heard about the news. The first member of the $*i*$-th pair has name $*a*_{*i*}$, the second one has name $*b*_{*i*}$. Each pair wondered if there is a substring of the lucky string containing both of their names. If so, they want to find the one with minimum length, which can give them good luck and make their friendship last forever.

Please help DZY for each pair find the minimum length of the substring of $*s*$ that contains both $*a*_{*i*}$ and $*b*_{*i*}$, or point out that such substring doesn't exist.

A substring of $*s*$ is a string $*s*_{*l*}*s*_{*l* + 1}... *s*_{*r*}$ for some integers $*l*, *r*$ $(1 ≤ *l* ≤ *r* ≤ |*s*|)$. The length of such the substring is $(*r* - *l* + 1)$.

A string $*p*$ contains some another string $*q*$ if there is a substring of $*p*$ equal to $*q*$.

Input

The first line contains a string $*s*$ $(1 ≤ |*s*| ≤ 50000)$.

The second line contains a non-negative integer $*q*$ $(0 ≤ *q* ≤ 100000)$ — the number of pairs. Each of the next $*q*$ lines describes a pair, the line contains two space-separated strings $*a*_{*i*}$ and $*b*_{*i*}$ $(1 ≤ |*a*_{*i*}|, |*b*_{*i*}| ≤ 4)$.

It is guaranteed that all the strings only consist of lowercase English letters.

Output

For each pair, print a line containing a single integer — the minimum length of the required substring. If there is no such substring, output -1.

Note

The shortest substrings in the first sample are: xyz, dyhduxyz.

The shortest substrings in the second sample are: ca, abc and abd.

The shortest substrings in the third sample are: baabca and abaa.