#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/*const ll maxn = 1e5;
int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;} */

const ll mod = 1e9+7;
ll n, k, m, mi, ma;

void solve(){
	
	ifstream cin("strmatch.in");
	ofstream cout("strmatch.out");
	
	string s, a, b;
	cin >> a;
	cin >> b;
	s = a + "." + b;
	n = s.size();
	ll l = 0, r = 0;
	vector<ll> z(n, 0);
	vector<int> ans;
	for(int i = 1; i<n; i++){
		if(i <= r) z[i] = min(r - i + 1, z[i - l]);
		ll j = 0;
		while(i + j + z[i] < n){
			if(s[ i + j + z[i] ] != s[ j + z[i] ]) break;
			j++;
		}
		z[i] += j;
		if(z[i] == a.size()){
			ans.pb(i - a.size() - 1);
		}
		if(i + z[i] - 1 <= r) continue;
		r = i + z[i] - 1;
		l = i;
	}
	ll m = ans.size();
	if(m > 1000) m = 1000;
	cout << ans.size() << "\n";
	for(int i = 0; i<m; i++) cout << ans[i] << " "; cout << "\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);

	//init();
	
	int t=1;
	//cin >> t;
	while(t--) solve();
	
	return 0;
}