#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define modul 998244353
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,p[5000005];
string s,t;
vector<int>ans;
void solve(){
t=(s+'#'+t);
int j=0;
for(int i=1;i<t.size();i++)
{
    if(t[i]==t[j]){
        p[i+1]=j+1;
        j++;
        continue;
    }
    while(j!=0){
        j=p[j];
        if(t[i]==t[j]){
            p[i+1]=j+1;
            j++;
            break;
        }
    }
}
for(int i=0;i<t.size();i++)
{
    if(p[i+1]==s.size()){
        ans.pb(i);
    }
}
}
int32_t main(){
CODE_START;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
cin>>s>>t;
solve();
cout<<ans.size()<<endl;
int n=ans.size();
for(int i=0;i<min(1000,n);i++)
{
    cout<<ans[i]-2*s.size()<<' ';
}
}