#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modu=1999999973;
const int modul=998244353;

int ans,pref[4000005];
vector<int>indx;
string s,t;

void kmp(){
    t=(s+"#"+t);
    int j=0;
    for(int i=1;i<t.size();i++){
        if(t[i]==t[j]){
            pref[i+1]=j+1;
            ++j;
            continue;
        }
        else{
            while(j!=0){
                j=pref[j];
                if(t[i]==t[j]){
                    pref[i+1]=j+1;
                    ++j;
                    break;
                }
            }
        }
    }
    for(int i=0;i<t.size();i++){
        if(pref[i+1]>=s.size()) indx.push_back(i);
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream cin("strmatch.in");
    ofstream cout("strmatch.out");
    cin >> s >> t;
    kmp();
    cout << indx.size() << '\n';
    int g=indx.size();
    for(int i=0;i<min(2000,g);i++) cout << indx[i]-2*s.size() << ' ';
}