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

using namespace std;

int lps[100];

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

    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");
    int nr = 0;
    string A;
    string B;
    vector <int> sir;
    fin >> A >> B;
    int M = A.size();
    int N = B.size();
    computeLPSArray(A, M, lps);

    if (M > B.size())
    {
        fout << 0;
        return 0;
    }
    /* afisare array lps
    for (int i = 0; i < M; i++)
    {
        cout << lps[i] << " ";
    }

    cout << '\n';
    */

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