Write a program that reads two strings, str1 and str2, as input. The length of str1 is at most 10000 and the length of str2 is at most 20. Place appropriate checks for the input lengths.

The strings contain only non white-space characters. 

The program outputs k numbers a_1 a_2 ... a_k, where k is the length of str2 and a_i is the number of times i bit prefix of string str2 occurs as a substring of str1.

For example, if

str1 = aaabcdaabbbaaa
str2 = aa

then the output of the program should be:

8 5

For the same str1, if str2 = ba, then the output should be:

4 1