#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define pb push_back
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005
#define x1 xdddddddddddddddddd
#define y1 ydddddddddddddddddd

string a,b;

int z[4000005],ans,n;

vector <int> sol;

int32_t main(){
    ifstream cin("strmatch.in");
    ofstream cout("strmatch.out");
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin >> a >> b; n=a.lg;
    a=a+b;
    int l=0,r=0;
    for(int i=1;i<a.lg;i++){
        if(r<i){
            l=r=i;
            while(r<a.lg && a[r]==a[r-i]) r++;
            z[i]=r-l;
            r--;
        }
        else{
            if(z[i-l]<r-i+1){
                z[i]=z[i-l];
            }
            else{
                l=i;
                while(r<a.lg && a[r]==a[r-i]) r++;
                z[i]=r-l;
                r--;
            }
        }
    }
    int g=0;
    for(int i=0;i<a.lg;i++){
        if(i>=n && z[i]>=n){
            ans++;
            if(sol.sz<1000) sol.pb(i-n);
        }
    }
    cout << ans << '\n';
    for(int i : sol) cout << i << ' ';
}