// C++ program for implementation of KMP pattern searching
// algorithm
#include <bits/stdc++.h>
using namespace std;

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

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

// Prints occurrences of txt[] in pat[]
vector <int> poz;
void KMPSearch(char* pat, char* txt)
{
	int M = strlen(pat);
	int N = strlen(txt);

	// create lps[] that will hold the longest prefix suffix
	// values for pattern
	int lps[M];

	// Preprocess the pattern (calculate lps[] array)
	computeLPSArray(pat, M, lps);

	int i = 0; // index for txt[]
	int j = 0; // index for pat[]
	while (i < N) {
		if (pat[j] == txt[i]) {
			j++;
			i++;
		}

		if (j == M) {
//			printf("Found pattern at index %d ", i - j);
            poz.push_back(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;
		}
	}
}

// Fills lps[] for given patttern pat[0..M-1]
void computeLPSArray(char* pat, int M, int* lps)
{
	// length of the previous longest prefix suffix
	int len = 0;

	lps[0] = 0; // lps[0] is always 0

	// the loop calculates lps[i] for i = 1 to M-1
	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++;
			}
		}
	}
}

// Driver program to test above function
const int NMAX=2000003;
char txt[NMAX] ;
char pat[NMAX] ;

int main()
{
    fin>>pat;
    fin>>txt;
	KMPSearch(pat, txt);
	fout<<poz.size()<<"\n";
	for(int i=0;i<poz.size(); ++i)
        fout<<poz[i]<<" ";
//	return 0;
}