#include <fstream>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

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

const int DIM = 4e6;

int N, M;
std :: string A, B, s;
int z[DIM + 2];
int cnt;
std :: vector<int> ans;

void z_function() {
	z[0] = 0;
	int right = 0, left = 0;

	for(int i = 1; i < s.size(); i++) {
		if(right >= i) {
			z[i] = std :: min(z[i - left], right - i + 1);
		}

		if(i + z[i] - 1 < right) {
			continue;
		}

		while(i + z[i] < s.size() && s[i + z[i]] == s[z[i]]) {
			z[i]++;
		}

		if(i + z[i] - 1 > right) {
			right = i + z[i] - 1;
			left = i;
		}
		if(z[i] == N) {
			cnt++;
			if(ans.size() + 1 <= 1000) {
				ans.push_back(i - N - 1);
			}
		}
	}	
}
int main() {
	fin >> A >> B;
	N = A.size();
	M = B.size();
	if(N > M) {
		fout << "0\n";
		return 0;
	}
	s = A + "#" + B;
	M = s.size();
	z_function();
	fout << cnt << '\n';
	for(int i = 0; i < ans.size(); i++) {
		fout << ans[i] << " ";
	}
	fin.close();
	fout.close();
	return 0;
}