PROGRAMMING:Implementing KMP with JMU DS
Give two strings a and B, and find out the position where B first appears from a.
###Input format:
Enter an integer n in the first line to indicate the number of test data
For each group of test data, enter two strings S T, s and T are separated by a space, and each group of data occupies one line.
###Output format:
For each group of test data, find out the position where B first appears in output A. if a does not contain B, output "not find!"
###Input example:
```in
three
abcdabbcd abbc
abcd efg
abbcdd bbc
```
###Output example:
```out
four
not find!
one
```
answer:If there is no answer, please comment
###Input format:
Enter an integer n in the first line to indicate the number of test data
For each group of test data, enter two strings S T, s and T are separated by a space, and each group of data occupies one line.
###Output format:
For each group of test data, find out the position where B first appears in output A. if a does not contain B, output "not find!"
###Input example:
```in
three
abcdabbcd abbc
abcd efg
abbcdd bbc
```
###Output example:
```out
four
not find!
one
```
answer:If there is no answer, please comment