#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <cstring>
#include <deque>
#include <stack>
#include <bitset>
#include <list>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp(a,b) make_pair (a, b)
#define ll long long
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)

using namespace std;

int N, M, cnt;
char A[2000011];
char B[2000011];
int Pi[2000011];
vector <int> v;

void Citire ()
{
    ifstream fin ("strmatch.in");
    fin >> (B + 1) >> (A + 1);
    N = strlen (A + 1);
    M = strlen (B + 1);
    for (int i = 0; i <= N; i++)
        cout << A[i];
    fin.close ();
}

void Precalculare ()
{
    Pi[1] = 0;
    int p = 0;
    for (int i = 2; i <= M; i++)
    {
        while (p > 0 && B[i] != B[p + 1]) p = Pi[p];
        if (B[i] == B[p + 1]) p++;
        Pi[i] = p;
    }
}

void Business ()
{
    int p = 0;
    for (int i = 1; i <= N; i++)
    {
        while (p > 0 && A[i] != B[p + 1]) p = Pi[p];
        if (A[i] == B[p + 1]) p++;
        if (p == M)
        {
            if (cnt < 1000) v.pb (i - M);
            cnt++;
            p = Pi[p];
        }
    }
}

void Scriere ()
{
    ofstream fout ("strmatch.out");
    fout << cnt << "\n";
    cnt = min (cnt, 1000);
    for (int i = 0; i < cnt; i++)
        fout << v[i] << " ";
    fout.close ();
}

int main ()
{
    Citire ();
    Precalculare ();
    Business ();
    Scriere ();
    return 0;
}