#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pair<int, int> pi
#define mp make_pair
#define forr(X) for(int i = 0; i<X; i++)
#pragma GCC optimize("Ofast")
#define F first
#define all(X) X.begin(), X.end()
#define S second
#define int ll
#define out(X) for(auto it: X){ for(auto ito : it)cout<<ito<<" "; cout<<endl;}
//#define MOD 1000000000000000031

void solve(){
	string sub, dom; cin>>sub>>dom;
	int cur=-1;
	vector<int>ans;
	bool b=1;
	while(cur!=string::npos||b){
		cur = dom.find(sub, cur+1);
		ans.pb(cur);
		b=0;
		//cout<<cur<<" ";
		//cur++;
	}
	int c=0;
	cout<<ans.size()-1<<endl;
	for(auto it:ans){
		if(c==1000 || it==-1){
			break;
		}
		c++;
		cout<<it<<' ';
		
	}
}

int32_t main(){
	freopen("strmatch.in", "r", stdin);
	freopen("strmatch.out", "w", stdout);
	//int t;cin>>t;while(t--)
	solve();
}