One day Dholu Bholu asked Kalia to treat them their favouite dish. Kalia agreed with a condition. He asked them to tell their favourite dish's name and Kalia gave them a long string containing name of some other foods ( including their favourite foods).
Now, they have to find the start indices of their favourite food present in the given string in any combination.
If they can find all of the indices Kalia will give them the treat.
But you know, how fool they both are :) . Help them to get the treat from Kalia.
Input Format
First line of input contains T denoting number of test cases.
First line of each test case contains a string W denoting name of their favourite food.
Second line of each test case contains a string S denoting Kalia's given food names.
Output Format
For each test print all start indices (space separated) of their favourite food (in sorted order) which may present in any combination.
Constraints
1<=T<=100
1<=length(W)<=length(S)<=2*105
All string inputs are in small characters
There are 4 such indices which may form the given favourite dish's name
1. Index 0 to 2, we can see that "tea" word is present
2. Index 6 to 8, combination of "tea" is present
3. Index 7 to 9, combination of "tea" is present
4. Index 8 to 10, combination of "tea" is present
