#include <iostream>
#include <fstream>
#include <string>
#include <queue>

using namespace std;

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

int n, m;
int lps[2000010];
string a, b;
queue<int> ans;

void buildLps()
{
    lps[0] = 0;
    int j = 0;

    for(int i = 1; i < n; i++)
    {
        while(j > 0 && a[i] != a[j])
            j = lps[j - 1];

        if(a[i] == a[j])
            j++;

        lps[i] = j;
    }
}

int main()
{
    in >> a >> b;

    n = a.size();
    m = b.size();

    buildLps();

    int j = 0;

    for(int i = 0; i < m; i++)
    {
        while(j > 0 && b[i] != a[j])
            j = lps[j - 1];

        if(b[i] == a[j])
            j++;

        if(j == n && ans.size() < 1000)
            ans.push(i - n + 1);
    }

    out << ans.size() << '\n';

    while(!ans.empty())
    {
        out << ans.front() << ' ';
        ans.pop();
    }

    return 0;
}