#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;


const string file = "strmatch";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;


vector<int> computeFail(string& A)
{
	vector<int> fail;
	int N = A.size();
	fail.resize(N);

	int c = 0;
	for(int i = 1; i < N; i++)
	{
		while(c > 0 && A[i] != A[c])
		{
			c = fail[c - 1];
		}

		if(A[i] == A[c])
		{
			c++;
		}
		fail[i] = c;

	}
	return fail;

}


int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);
#endif	

	string A;
	string B;

	int nrMatches = 0;
	vector<int> matches;

	fin >> A >> B;

	vector<int> fail = computeFail(A);

	int N = fail.size();
	int M = B.size();
	int c = 0;
	for(int i = 0; i < M; i++)
	{
		while(c > 0 && A[c] != B[i])
		{
			c = fail[c - 1];
		}

		if(A[c] == B[i])
			c++;

		if(c == N)
		{
			if(nrMatches < 1000)
			{
				matches.push_back(i - N + 1);
			}
			nrMatches ++;
			c = fail[c - 1];
		}
	}


	fout << nrMatches << "\n";

	for(int i = 0; i < matches.size() && i < 1000; i++)
	{
		fout << matches[i] << " ";
	}
	fout << "\n";


#ifdef ONLINE_JUDGE
#else

	fin.close();
	fout.close();
#endif
}