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

using namespace std;

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

const int MAXN = 2000005;
string a, b;
int p[MAXN], n, m;
vector<int> sol;

void generare_prefixe()
{
    int i = 0, j = p[0] = -1;
    while(i < n)
    {
        while(j+1 && a[i] != a[j])
            j = p[j];
        p[++i] = ++j;
    }
}

void kmp()
{
    int i = 0, j = 0;
    while(i < m)
    {
        while(j+1 && b[i] != a[j])
            j = p[j];
        i++;
        j++;
        if(j == n)
        {
            j = p[j];
            if(sol.size() <= 1000)
                sol.push_back(i-n);
            else
                return;
        }
    }
}

int main()
{
    fin >> a >> b;
    n = a.size(); m = b.size();
    generare_prefixe();
    kmp();
    fout << sol.size() << "\n";
    int len = min((int)sol.size(), 1001);
    for(int i = 0; i < len; i++)
        fout << sol[i] << " ";
    return 0;
}