#include <bits/stdc++.h>

using namespace std;

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

const int nmax=2e6+5;
string s,t;
int lps[nmax];

void create_lps(int m)
{
    int i=1, lg=0;
    lps[0]=0;

    while ( i<m )
    {
        if ( s[i]==s[lg] )
        {
            lg++;
            lps[i]=lg;
            i++;
        }
        else if ( lg ) lg=lps[lg-1];
        else
        {
            lps[i]=0;
            i++;
        }
    }
}

vector <int> rez;

void kmp(int n, int m)
{
    int lg=0, i=0;
    while ( i<n )
    {
        if ( t[i]==s[lg] )
        {
            lg++; i++;
            if ( lg==m )
            {
                rez.push_back(i-m);
                lg=lps[lg-1];
            }
        }
        else if ( lg ) lg=lps[lg-1];
        else i++;
    }
}

int main()
{
    f >> s >> t;

    create_lps(s.size());

    /*for (int i=0; i<s.size(); i++ )
        cout << lps[i] << " ";*/

    kmp(t.size(),s.size());

    g << rez.size() << '\n';
    int cnt=min(1000,(int)rez.size());

    for (int i=0; i<cnt; i++ )
        g << rez[i] << " ";

    return 0;
}