#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

int solCnt;
int n, m;
int pos[1005], lps[2000005];
char pat[2000005], txt[2000005];

/*
// Fills lps[] for given patttern pat[0..M-1] 
void computeLPSArray(char* pat, int M, int* lps)
{
    // length of the previous longest prefix suffix 
    int len = 0;

    lps[0] = 0; // lps[0] is always 0 

    // the loop calculates lps[i] for i = 1 to M-1 
    int i = 1;
    while (i < M) {
        if (pat[i] == pat[len]) {
            len++;
            lps[i] = len;
            i++;
        }
        else // (pat[i] != pat[len]) 
        {
            // This is tricky. Consider the example. 
            // AAACAAAA and i = 7. The idea is similar 
            // to search step. 
            if (len != 0) {
                len = lps[len - 1];

                // Also, note that we do not increment 
                // i here 
            }
            else // if (len == 0) 
            {
                lps[i] = 0;
                i++;
            }
        }
    }
}

void KMPSearch(char* pat, char* txt)
{
    m = strlen(pat);
    n = strlen(txt);

    // Preprocess the pattern (calculate lps[] array) 
    computeLPSArray(pat, m, lps);

    int i = 0; // index for txt[] 
    int j = 0; // index for pat[] 
    while (i < n) {
        if (pat[j] == txt[i]) {
            j++;
            i++;
        }

        if (j == m) {
            if (solCnt < 1000)
                pos[solCnt++] = i - j;
            else
                solCnt++;
            j = lps[j - 1];
        }

        // mismatch after j matches 
        else if (i < n && pat[j] != txt[i]) {
            // Do not match lps[0..lps[j-1]] characters, 
            // they will match anyway 
            if (j != 0)
                j = lps[j - 1];
            else
                i = i + 1;
        }
    }
}
*/


int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    scanf("%s", pat);
    scanf("%s", txt);

    KMPSearch(pat, txt);

    printf("%d\n", solCnt);
    for (int i = 0; i < std::min(solCnt, 1000); ++i)
        printf("%d ", pos[i]);
    return 0;
}