#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

int last[2000010];
vector<int> sol;
string a, b;

void pref() {
	int k = 0;
	last[1] = 0;
	for (int i = 2; i < a.length(); i++) {
		while (k > 0 && a[k+1] != a[i]) k = last[k];
		if (a[k+1] == a[i]) k++;
		last[i] = k;
	}	
}

void kmp() {
	int k = 0;
	for (int i = 1; i < b.length(); i++) {
		while (k > 0 && a[k+1] != b[i]) k = last[k];
		if (a[k+1] == b[i]) {
			k++;
			if (k == a.length() - 1) {
				if (sol.size() < 1000) {
					sol.push_back(i - a.length() + 1);
				}
				k = last[k];
			}
		}
	}
}

int main() {
	int x, y;
	freopen("strmatch.in","r",stdin);
	freopen("strmatch.out","w",stdout);
	
	cin >> a;
	cin >> b;
	a = " " + a;
	b = " " + b;
	pref();
	kmp();
	
	printf("%d\n", sol.size());
	for (int i = 0; i < sol.size(); i++) {
		printf("%d ", sol[i]);
	}
	
	return 0;
}