#include <iostream>
#include <fstream>
#define LG_MAX 2000001

using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

char s[LG_MAX], p[LG_MAX];

int sol[1001], lps[LG_MAX], cnt;

void precalculare()
{
	int len = 0;
	int lg_p = strlen(p);
	lps[0] = 0;
	int i = 1;
	while (i < lg_p) {
		if (p[i] == p[len]) {
			len++;
			lps[i] = len;
			i++;
		}
		else
		{
			if (len != 0) {
				len = lps[len - 1];
			}
			else
			{
				lps[i] = 0;
				i++;
			}
		}
	}
}

void KMP(char* p, char* s)
{
	int lg_p = strlen(p), lg_s = strlen(s), i = 0, j = 0;
	precalculare();
	while (i < lg_s) {
		if (s[i] == p[j])
		{
			i++;
			j++;
		}
		if (j == lg_p)
		{
			j = lps[j - 1];
			if (cnt < 1000) {
				cnt++;
				sol[cnt] = i - j - 2;
			}
			else {
				return;
			}
			//cout << i - j - 2 << ' ';
			//am gasit pattern la i-j-2
		}
		else if (i < lg_s && s[i] != p[j])
		{
			if (j != 0)
				j = lps[j - 1];
			else
				i++;
		}
	}
}

int main()
{
	fin.getline(p, LG_MAX);
	fin.getline(s, LG_MAX);
	KMP(p, s);
	fout << cnt << '\n';
	for (int i = 1; i <= cnt; i++) {
		fout << sol[i] << ' ';
	}
}