DZY Loves Strings

题意翻译

给出一个串 $S$，$n$ 次询问。每次询问给出两个串 $a,b(1\le|a|,|b|\le 4)$，求 $S$ 的最短的包含 $a,b$ 的字串。若不存在输出 $-1$。

题目描述

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 $ .

输入输出格式

输入格式

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.

输出格式

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.

输入输出样例

输入样例 #1

xudyhduxyz
3
xyz xyz
dyh xyz
dzy xyz

输出样例 #1

3
8
-1

输入样例 #2

abcabd
3
a c
ab abc
ab d

输出样例 #2

2
3
3

输入样例 #3

baabcabaaa
2
abca baa
aa aba

输出样例 #3

6
4

说明

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.

题意翻译

给出一个串 $S$，$n$ 次询问。每次询问给出两个串 $a,b(1\le|a|,|b|\le 4)$，求 $S$ 的最短的包含 $a,b$ 的字串。若不存在输出 $-1$。