using namespace std;

#include<iomanip>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<utility>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<numeric>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<deque>

const int INFI=(1LL<<29)-100;
const long long INFL=(1LL<<62)-100;
const double eps=1e-10;
const long double pi=acos(-1.0);
const int MAXN=2000010;

char a[MAXN],b[MAXN];
int fail[MAXN];

void build(char a[],int n){
    for(int i=2,q=0;i<=n;i++){
        while(q && a[i]!=a[q+1]){
            q=fail[q];
        }
        if(a[q+1]==a[i]){
            q++;
        }
        fail[i]=q;
    }

    return;
}

int main(){
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);

    gets(a+1);
    gets(b+1);
    a[0]=b[0]=1;

    int n=strlen(a)-1;
    int m=strlen(b)-1;

    build(a,n);
    vector<int> sl;

    for(int i=1,q=0;i<=m;i++){
        while(q && a[q+1]!=b[i]){
            q=fail[q];
        }
        if(a[q+1]==b[i]){
            q++;
        }
        if(q==n){
            sl.push_back(i-n);
        }
    }

    printf("%d\n",sl.size());
    for(unsigned j=0;j<sl.size() && j<1000;j++){
        printf("%d ",sl[j]);
    }

    return 0;
}