#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>
using namespace std;

const string file = "strmatch";

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

const int INF = 0x3f3f3f3f;

string A;
string B;

int N;
vector<int> fail;


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

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

}

int main()
{
	fstream fin(infile.c_str(), ios::in);
	int Sol = 0;
	getline(fin, A);
	getline(fin, B);
	fin.close();
	N = A.size();
	fail.resize(N);
	computeFail();
	vector<int> matches;
	matches.reserve(1000);
	int c = 0;
	for(int i = 0; i < (int)B.size();i++)
	{
		while(c > 0 && A[c] != B[i])
		{
			c = fail[c - 1];
		}

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

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


	fstream fout(outfile.c_str(), ios::out);
	fout << Sol << "\n";

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