#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

long long int lps[1024];

void computeLPSArray(string pat, long long int M, long long int lps[])
{
    long long int len = 0;
    lps[0] = 0;

    long long int i = 1;

    while (i < M)
    {
        if (pat[i] == pat[len])
        {
            len++;
            lps[i] = len;
            i++;
        }
        else
        {
            if (len != 0)
            {
                len = lps[len - 1];
            }
            else
            {
                lps[i] = 0;
                i++;
            }
        }
    }
}



int main()
{
    ifstream fin("strmatch.in");
    ofstream fout("strmatch.out");
    long long int nr = 0;
    string A;
    string B;
    vector <long long int> sir;
    fin >> A >> B;
    long long int M = A.size();
    long long int N = B.size();
    computeLPSArray(A, M, lps);
    /* afisare array lps
    for (int i = 0; i < M; i++)
    {
        cout << lps[i] << " ";
    }

    cout << '\n';
    */

    if (M > N)
    {
        fout << nr;
        return 0;
    }

    int j = 0;
    int i = 0;
    while (i < N && nr != 1000)
    {
        if (A[j] == B[i])
        {
            j++;
            i++;
        }
        if (j == M && j != 0)
        {
            j = lps[j - 1];
            sir.push_back(i - M);
            nr++;
        }
        else if (i < N && A[j] != B[i])
        {
            if (j != 0)
                j = lps[j - 1];
            else
                i++;
        }
    }
    fout << nr << " ";
    for (int i = 0; i < sir.size(); i++)
    {
        fout << sir[i] << " ";
    }
    return 0;
}