#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char P[2000003];
char T[2000003];
int urm[2000003];
int rez,depl[1001];
int n,m;
void urmatorul(char *P)
{
    //m = lungimea modelului
    int x,k=-1;
    urm[0]=0;
    for(x=1;x<m;++x)
    {
        while(k>0 && P[k+1]!=P[x]) k=urm[k];
        if(P[k+1]==P[x]) ++k;
        urm[x]=k;
    }
}
int main()
{
    f.getline(P,2000003); m=strlen(P);
    f.getline(T,2000003); n=strlen(T);
    urmatorul(P);
    int x=-1,i;
    for(i=0;i<n;++i)
    {
        while(x>0 && P[x+1]!=T[i]) x=urm[x];
        if(P[x+1]==T[i]) ++x;
        if(x==m-1 && rez<1000) //daca am gasit tot modelul in text
        {
            ++rez;
            depl[rez]=i-m+1;
        }
    }
    g<<rez<<'\n';
    rez=min(1000,rez);
    for(i=1;i<=rez;++i) g<<depl[i]<<" ";
    return 0;
}
#include <fstream>
#include <cstring>
#define DIM 2000010

using namespace std;


int P[DIM], S[1010];
char A[DIM], B[DIM];
int n, m, i, q, k;

int main() {
    ifstream fin("strmatch.in");
    ofstream fout("strmatch.out");
    fin>>A+1; n = strlen(A+1);
    fin>>B+1; m = strlen(B+1);

    // preprocesare pentru A: A[i] = lungimea maxima a unui sufix al lui A terminat pepozitia i
    // care e in acelasi timp prefix (lungime < i)
    q = 0;
    P[1] = 0;
    for (i=2;i<=n;i++) {
        // calcule P[i]
        while (A[i] != A[q+1] && q!=0)
            q = P[q];

        if (A[i] == A[q+1])
            ++q;

        P[i] = q;
    }

    q = 0;
    for (i=1;i<=m;i++) {
        while (B[i] != A[q+1] && q!=0)
            q = P[q];
        if (B[i] == A[q+1])
            q++;

        if (q == n) {
            k++;
            if (k<=1000)
                S[k] = i-n;
            q = P[q];
        }
    }
    fout<<k<<"\n";
    if (k > 1000)
        k = 1000;

    for (i=1;i<=k;i++)
        fout<<S[i]<<" ";

    return 0;
}