#include <fstream>
#include <iostream>
#include <iterator>
#include <vector>
#include <string>

#define MAXN 2000005

using namespace std;

int SkipTable[MAXN];

void BuildSkipTable(const string& sPattern)
{
    int iPatternLength = sPattern.length();
    int iPatternIndex = 2;
    int iCandidateIndex = 0;
    
    while (iPatternIndex < iPatternLength)
    {
        while (sPattern[iCandidateIndex] != sPattern[iPatternIndex-1] && iCandidateIndex > 0)
        {
            iCandidateIndex = SkipTable[iCandidateIndex];
        }
        
        if (sPattern[iCandidateIndex] == sPattern[iPatternIndex-1])
        {
            ++iCandidateIndex;
            SkipTable[iPatternIndex] = iCandidateIndex;
        }
        
        ++iPatternIndex;
    }
}

template<typename OutputIterator>
int kmp_search(const string& sPattern, const string& sText, OutputIterator itOut)
{
    int iTotalMatched = 0;
    int iPatternLength = sPattern.length();
    int iPatternIndex = 0;
    int iTextLength = sText.length();
    int iTextIndex = 0;
    
    while (iTextIndex < iTextLength)
    {
        while (sText[iTextIndex] != sPattern[iPatternIndex] && iPatternIndex > 0)
        {
            iPatternIndex = SkipTable[iPatternIndex];
        }
        
        if (sText[iTextIndex] == sPattern[iPatternIndex])
        {
            ++iPatternIndex;
            if (iPatternIndex == iPatternLength)
            {
                iPatternIndex = SkipTable[iPatternIndex-1];
                ++iTotalMatched;
                
                if (iTotalMatched <= 1000)
                {
                    *itOut = iTextIndex - iPatternLength + 1;
                    ++itOut;
                }
            }
            else
            {
                ++iTextIndex;
            }
        }
        else
        {
            ++iTextIndex;
        }
    }
    
    return iTotalMatched;
}

int main()
{
    string pattern;
    string text;
    vector<int> vMatches;
    fstream fin("strmatch.in", fstream::in);
    fstream fout("strmatch.out", fstream::out);
    
    fin >> pattern >> text;
    //cout << pattern << endl << text << endl;
    
    BuildSkipTable(pattern);
    const int iTotalMatches = kmp_search(pattern, text, back_inserter(vMatches));
    
    fout << iTotalMatches << "\n";
    ostream_iterator<int> itOut(fout, " ");
    copy(vMatches.begin(), vMatches.end(), itOut);
    fout << "\n";
    
    fin.close();
    fout.close();
    return 0;
}