#include <bits/stdc++.h>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char s[2000005],sub[20000005];
vector <int> v;
#define mod1 666013
#define mod2 10003
int n,m,v1,v2,h1,h2,p1=1,p2=1,k;
const int p=127;
int main()
{
    f>>sub>>s;
    n=strlen(sub);
    m=strlen(s);
    if(n>m) {g<<0;return 0;}
    for(int i=0;i<n;++i)
    {
        h1=(h1*p+sub[i])%mod1;
        h2=(h2*p+sub[i])%mod2;
        if(i!=0) {p1=(p*p1)%mod1;p2=(p*p2)%mod2;}
        v1=(v1*p+s[i])%mod1;
        v2=(v2*p+s[i])%mod2;
    }
    if(h1==v1 && h2==v2)
    {
        v.push_back(1);
        k++;
    }
    for(int i=n;i<m;++i)
    {
        v1=((v1-(s[i-n]*p1)%mod1+mod1)*p+s[i])%mod1;
        v2=((v2-(s[i-n]*p2)%mod2+mod2)*p+s[i])%mod2;
        if(h1==v1 && h2==v2)
        {
            if(k<1001) v.push_back(i-n+1);
            k++;
        }
    }
    g<<k<<'\n';
    for(int i=0;i<k;++i) g<<v[i]<<' ';
    return 0;
}