#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double
int ceildiv(int one, int two) {
	if (one % two == 0) {return one / two;}
	else {return one / two + 1;}
} int power(int n, int pow, int m) {
	if (pow == 0) return 1;
	if (pow % 2 == 0) {
		ll x = power(n, pow / 2, m);
		return (x * x) % m;
	}
	else return (power(n, pow - 1, m) * n) % m;
} int gcd(int a, int b) {
	if (!b)return a;
	return gcd(b, a % b);
} int factorial(int n, int mod) {
	if (n > 1)
		return (n * factorial(n - 1, mod)) % mod;
	else
		return 1;
} int lcm(int a, int b) {
	return (a * b) / gcd(a, b);
} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}vector<vector<int>> adj;void init(int n) {for (int i = 0; i <= n; i++) { vector<int> a; adj.pb(a);}}

vector<int> prefix_function(string s) {
	int n = (int)s.length();
	vector<int> pi(n);
	for (int i = 1; i < n; i++) {
		int j = pi[i-1];
		while (j > 0 && s[i] != s[j])
			j = pi[j-1];
		if (s[i] == s[j])
			j++;
		pi[i] = j;
	}
	return pi;
}

vector<int> rabin_karp(string const& s, string const& t) {
	const int p = 31;
	const int m = 1e9 + 9;
	int S = s.size(), T = t.size();

	vector<long long> p_pow(max(S, T));
	p_pow[0] = 1;
	for (int i = 1; i < (int)p_pow.size(); i++)
		p_pow[i] = (p_pow[i-1] * p) % m;

	vector<long long> h(T + 1, 0);
	for (int i = 0; i < T; i++)
		h[i+1] = (h[i] + (t[i] - 'A' + 1) * p_pow[i]) % m;
	long long h_s = 0;
	for (int i = 0; i < S; i++)
		h_s = (h_s + (s[i] - 'A' + 1) * p_pow[i]) % m;

	vector<int> occurences;
	for (int i = 0; i + S - 1 < T; i++) {
		long long cur_h = (h[i+S] + m - h[i]) % m;
		if (cur_h == h_s * p_pow[i] % m)
			occurences.push_back(i);
	}
	return occurences;
}

int32_t main() {
	startt;
	//freopen("strmatch.in", "r", stdin);
	//freopen("strmatch.out", "w", stdout);
	string s, t;
	cin >> s >> t;
	vint a = rabin_karp(s, t);
	cout << a.size() << endl;
	for(auto x : a)
	{
		cout << x << " ";
	}
}