#include <bits/stdc++.h>
using namespace std;

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

void computeLPSArray(string pat, int m, vector<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++;
            }
        }
    }
}

void KMPSearch(string pat, string txt)
{
    int m = pat.size();
    int n = txt.size(); 
   // cout << "M: " << m << '\n';
    vector<int> lps(m);
    vector<int> rez;
    
    computeLPSArray(pat, m, lps);
 
    int i = 0;
    int j = 0; 
    while ((n - i) >= (m - j)) {
        if (pat[j] == txt[i]) {
            j++;
            i++;
        }
 
        if (j == m) {
            rez.emplace_back(i - j);
            j = lps[j - 1];
        }
 
        else if (i < n && pat[j] != txt[i]) {
            if (j != 0)
                j = lps[j - 1];
            else
                i++;
        }
    }
    writer << rez.size() << '\n';
    if(rez.size() > 1000)
        for(int i = 0; i < 1000; ++i)
            writer << rez[i] << ' ';
    else
        for(auto it : rez)
            writer << it << ' ';
}



int main()
{
    #ifndef ONLINE_JUDGE
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    string txt, pat;
    reader >> pat >> txt;
    KMPSearch(pat, txt);
    return 0;
}