SPOJ Brasil

Your task is so simple given a string and a pattern. You find the pattern on the given string. If found print how many time found the pattern and their index. Otherwise print ‘Not Found’.

Input

The input   line consists of a number T (1 ≤ T ≤ 50) test cases.

For each case given two string number  A,B. the string and the pattern  1 ≤ |A|, |B| ≤ 10⁶

All character will be lowercase Latin character.  And |  | is the length of string.

Output

For each case print the number  (found pattern from the given string) next line their positions. Otherwise print 'Not Found' without quotes.

Output a blank line between two cases.

Example

Input:
3
ababab ab
aaaaa bbb
aafafaasf aaf

Output:
3
1 3 5

Not Found

1
1

Hints: Here all index is 1 based.