#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
char txt[2000000], pat[2000000];
int lps[2000000];
int sir[1001];
int k = 0;

void computeLPSArray(char* pat, int M, int* lps);

void KMPSearch(char* pat, char* txt)
{
	int M = strlen(pat);
	int N = strlen(txt);
	computeLPSArray(pat, M, lps);
	int i = 0;  
	int j = 0; 
	while (i < N) {
		if (pat[j] == txt[i]) {
			j++;
			i++;
		}

		if (j == M) {
			//printf("Found pattern at index %d ", i - j);
			sir[k++] = i - j;
			j = lps[j - 1];
		}

		else if (i < N && pat[j] != txt[i]) {
			if (j != 0)
				j = lps[j - 1];
			else
				i = i + 1;
		}
	}
}

void computeLPSArray(char* pat, int M, int* lps)
{
	int len = 0;
	lps[0] = 0; 
	int i = 1;
	while (i < M) {
		if (pat[i] == pat[len]) {
			len++;
			lps[i] = len;
			i++;
		}
		else 
		{
			if (len != 0) {
				len = lps[len - 1];
			}
			else 
			{
				lps[i] = 0;
				i++;
			}
		}
	}
}


int main() {


	fstream f("strmatch.in");
	ofstream g("strmatch.out");
	
	f >> txt;
	f >> pat;
	//cout << txt << strlen(txt) << "\n";
	//cout << pat << strlen(pat) << "\n";

	KMPSearch(txt, pat);

	g << k << "\n";
	if (k < 1000) {
		for (int i = 0; i < k; i++) {
			g << sir[i] << " ";
		}
	}
	else {
		for (int i = 0; i < 1000; i++) {
			g << sir[i] << " ";
		}
	}


	f.close();


	return 0;
}