#include <stdio.h>
#include <string.h>

char a[2000005], b[2000005];
unsigned int  nOcc=0, i, j, sizeP, sizeS;
int occ[1005], f[2000005];
void buildF()
{
	for (i = 1; i < sizeP; ++i)
	{
		j = f[i - 1];
		while (j != -1 && a[j]!=a[f[j-1]])
		{
			j = f[j - 1];
		}
		f[i] = j + 1;
	}
}

int main()
{
	freopen("strmatch.in", "r", stdin);
	freopen("strmatch.out", "w", stdout);

	scanf("%s%s", a, b);

	sizeP = strlen(a);
	sizeS = strlen(b);

	memset(f, -1, sizeP * 4);
	memset(occ, -1, 1000 * 4);

	buildF();//build the bad suffix good prefix function

	i = j = 0;
	while (i + j < sizeS)
	{
		if (b[i + j] == a[j])//the characters match
		{
			if (j == sizeP-1)//found an occurence
			{
				occ[nOcc++] = i;

				if (nOcc == 1000)//max occurences found
				{
					break;
				}

				i = i + j - f[j];
				j = f[j];
			}
			else
			{
				j++;
			}
		}
		else//use the bad suffix to find good prefix
		{
			if (j == 0)//no good prefix can exist, moving to the next char in string
			{
				i++;
			}
			else
			{
				i = i + j - f[j];
				j = f[j];
			}
		}
	}

	for (i = 0; i < nOcc; ++i)
	{
		printf("%d ", occ[i]);
	}
}