#include<bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

char s1[2000010],s2[2000010];

int prefix[2000010],n,m;

vector<int>ans;

int main()
{
    fin>>s1;
    fin>>s2;
    n=strlen(s1);
    m=strlen(s2);
    int j=0;
    for(int i=1; i<=n-1; i++)
    {
        while(j>0&&s1[i]!=s1[j])
            j=prefix[j-1];
        if(s1[i]==s1[j])
            j++;
        prefix[i]=j;
    }
    j=0;
    for(int i=1; i<m; i++)
    {
        while(s2[i]!=s1[j]&&j>0)
            j=prefix[j-1];
        if(s2[i]==s1[j])
            j++;
        if(j==n)
            ans.push_back(i-n+1);
    }
    int val=ans.size();
    fout<<val<<'\n';
    val=min(val,1000);
    for(int i=0; i<val; i++)
        fout<<ans[i]<<" ";
    return 0;
}