#include <iostream>
#include <fstream>
#include <vector>
#define MOD1 20000009
#define MOD2 20000111
#define hashVal 63
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n1, n2, count = 0, stringA1_hashVal, stringB1_hashVal, stringA2_hashVal, stringB2_hashVal;
vector<int> ans;

int getVal(char c) {
	if (c >= 'a' && c <= 'z') {
		return c - 'a' + 1;
	} else if (c >= 'A' && c <= 'Z') {
		return c - 'A' + 27;
	}
	return c - '0' + 53;
}

int main() {
	string s1, s2;
	f >> s2 >> s1;
	n1 = s1.length();
	n2 = s2.length();
	int hashFactor1 = 1, hashFactor2 = 1;
	
	for (int i = 1; i < n2; i++) {
		hashFactor1 = hashFactor1 * hashVal % MOD1;
		hashFactor2 = hashFactor2 * hashVal % MOD2;
	}
	if (n1 < n2) {
		g << 0;
		return 0;
	}
	
	for (int i = 0; i < n2; i++) {
		int val = getVal(s2[i]);
		stringB1_hashVal = (stringB1_hashVal * hashVal + val) % MOD1;
		stringB2_hashVal = (stringB2_hashVal * hashVal + val) % MOD2;
	}
	
	for (int i = 0; i < n2; i++) {
		int val = getVal(s1[i]);
		stringA1_hashVal = (stringA1_hashVal * hashVal + val) % MOD1;
		stringA2_hashVal = (stringA2_hashVal * hashVal + val) % MOD2;
	}
	if (stringA2_hashVal == stringB2_hashVal && stringA2_hashVal == stringB2_hashVal) {
		count++;
		ans.push_back(0);
	}
	
	for (int i = n2; i < n1; i++) {
		int prevVal = getVal(s1[i-n2]);
		int val = getVal(s1[i]);
		
		stringA1_hashVal = ((stringA1_hashVal - (prevVal * hashFactor1 % MOD1) + MOD1) % MOD1 * hashVal + val) % MOD1;
		stringA2_hashVal = ((stringA2_hashVal - (prevVal * hashFactor2 % MOD2) + MOD2) % MOD2 * hashVal + val) % MOD2;
		
		if (stringA1_hashVal == stringB1_hashVal && stringA2_hashVal == stringB2_hashVal) {
			count++;
			if (count <= 1000)
				ans.push_back(i - n2 + 1);
		}
	}
	
	g << count << "\n";
	for (int i = 0; i < ans.size(); i++)
		g << ans[i] << " ";
	return 0;
}