#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 2e6+2;
int n,m;
string pattern,text;
int lps[nmax];
vector<int> rasp;

inline void build_table()
{
    int j=0;
    for(int i=1; i<pattern.length(); i++)
    {
        while(j>0 && pattern[i] != pattern[j])
            j = lps[j - 1];
        if(pattern[i] == pattern[j])
            j++;
        lps[i] = j;
    }
}

inline void kmp_search()
{
    int j=0;
    for(int i=0; i<text.length(); i++)
    {
        while(j>0 && text[i] != pattern[j])
            j = lps[j-1];
        if(text[i] == pattern[j])
            j++;
        if(j == pattern.length())
        {
            rasp.push_back(i - j + 1);
            j = lps[j - 1];
        }
    }
}

int main()
{
    fin>>pattern>>text;
    build_table();
    kmp_search();
    n = rasp.size();
    fout<<min(n, 1000)<<"\n";
    for(int i = 0; i < min(n,1000); i++)
        fout<<rasp[i]<<" ";
    return 0;
}