#include <fstream>
#include <cstring>
#include <vector>
using namespace std;

#define NMax 2000005

ifstream f("strmatch.in");
ofstream g("strmatch.out");

vector<int> sol;

char A[NMax],B[NMax];
int pi[NMax];

int n,m;

void pref()
{
    int i, q = 0;
    pi[1] = 0;
    for(i=2;i<=m;++i)
    {
        while(q && A[q+1] != A[i]) q = pi[q];
        if(A[q+1] == A[i]) q++;
        pi[i] = q;
    }
}

void solve()
{
    int i, q = 0;
    for(i=1;i<=n;++i)
    {
        while(q && A[q+1] != B[i]) q = pi[q];
        if(A[q+1] == B[i]) q++;
        if(q == m)
        {
            q = pi[q];
            sol.push_back(i-m);
        }
    }
}

int main()
{
    f>>(A+1)>>(B+1);

    m = strlen(A+1);
    n = strlen(B+1);

    pref();
    solve();

    g<<sol.size()<<"\n";
    for(int i=0;i<min((int)sol.size(),1000);++i) g<<sol[i]<<" "; g<<"\n";

    f.close();
    g.close();
    return 0;
}