Openjudge: find all substring positions

describe

Enter two strings s1,s2, find s2 stay s1 All the places that appear in

The appearance of two substrings cannot overlap . for example 'aa' stay aaaa The only place in the 0,2

Input

The first line is an integer n
Next there is n That's ok , Two strings without spaces on each line s1,s2

Output

For each line , From small to large output s2 stay s1 All the positions in . Location slave 0 Start counting
If s2 It didn't show up , Output "no"
It doesn't matter to output more spaces at the end of the line

The sample input

4
ababcdefgabdefab ab
aaaaaaaaa a
aaaaaaaaa aaa 
112123323 a

Sample output

0 2 9 14 
0 1 2 3 4 5 6 7 8 
0 3 6 
no

Code

n = int(input())
for i in range(n):
    s = input().split()
    m = 0
    if s[1] not in s[0]:
        print('no', end='')
    for j in s[0]:
        a = s[0].find(s[1],m)
        if a == -1:
            continue
        else:
            m = a + len(s[1])
            print(a,'',end='')
    print("")    # Each loop wrap