#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);}}

int32_t main() {
	startt;
	freopen("strmatch.in", "r", stdin);
	freopen("strmatch.out", "w", stdout);
	string s, t;
	cin >> s >> t;
	if(s.size() > t.size())
	{
		cout << 0 << endl;
		return 0;
	}
	int hash1 = 0, hash2 = 0;
	int now1 = 1, now2 = 1;
	int nowpw1[s.size()+1], nowpw2[s.size()+1];
	for(int i = s.size()-1; i >= 0; i--)
	{
		nowpw1[i] = now1;
		nowpw2[i] = now2;
		hash1+=(s[i]-'A')*now1;
		hash1%=MOD;
		hash2+=(s[i]-'A')*now2;
		hash2%=MOD2;
		now1*=31;
		now2*=31;
		now1%=MOD;
		now2%=MOD2;
	}
	vint occurences;
	int hashcomp1 = 0;
	int hashcomp2 = 0;
	for(int i = 0; i < s.size(); i++)
	{
		hashcomp1+=(t[i]-'A')*nowpw1[i];
		hashcomp2+=(t[i]-'A')*nowpw2[i];
		hashcomp1%=MOD;
		hashcomp2%=MOD2;
	}
	if(hashcomp1 == hash1 && hashcomp2 == hash2)
	{
		occurences.pb(1);
	}
	for(int i = s.size(); i < t.size(); i++)
	{
		hashcomp1-=(t[i-s.size()]-'A')*nowpw1[0];
		if(hashcomp1 < 0)
		{
			hashcomp1 = MOD-abs(hashcomp1)%MOD;
		}
		hashcomp1*=31;
		hashcomp1+=(t[i]-'A');
		hashcomp1%=MOD;
		hashcomp2-=(t[i-s.size()]-'A')*nowpw2[0];
		if(hashcomp2 < 0)
		{
			hashcomp2 = MOD2-abs(hashcomp2)%MOD2;
		}
		hashcomp2*=31;
		hashcomp2+=(t[i]-'A');
		hashcomp2%=MOD2;
		if(hash1 == hashcomp1 && hash2 == hashcomp2)
		{
			occurences.pb(i-s.size()+1);
		}
	}
	cout << occurences.size() << endl;
	for(auto x : occurences)
	{
		cout << x << " ";
	}
}