#include<fstream>
#include<algorithm>
#include<vector>
#include<cstring>
#define P 999983
//#include<iostream>
using namespace std;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
#define d 256
int cnt=0;
vector<int >a;
/* pat -> pattern
    txt -> text
    q -> A prime number
*/ char txt[2000001] = "GEEKS FOR GEEKS";
char pat[2000001] = "GEEK";
void search(char pat[], char txt[], int q)
{
    int M = strlen(pat);
    int N = strlen(txt);
    int i, j;
    int p = 0; // hash value for pattern
    int t = 0; // hash value for txt
    int h = 1;

    // The value of h would be "pow(d, M-1)%q"
    for (i = 0; i < M - 1; i++)
        h = (h * d) % q;

    // Calculate the hash value of pattern and first
    // window of text
    for (i = 0; i < M; i++) {
        p = (d * p + pat[i]) % q;
        t = (d * t + txt[i]) % q;
    }

    // Slide the pattern over text one by one
    for (i = 0; i <= N - M; i++) {

        // Check the hash values of current window of text
        // and pattern. If the hash values match then only
        // check for characters one by one
        if (p == t) {
            /* Check for characters one by one */
            for (j = 0; j < M; j++) {
                if (txt[i + j] != pat[j]) {
                    break;
                }
            }

            // if p == t and pat[0...M-1] = txt[i, i+1,
            // ...i+M-1]

            if (j == M)
            { cnt++;a.push_back(i);}
        }

        // Calculate hash value for next window of text:
        // Remove leading digit, add trailing digit
        if (i < N - M) {
            t = (d * (t - txt[i] * h) + txt[i + M]) % q;

            // We might get negative value of t, converting
            // it to positive
            if (t < 0)
                t = (t + q);
        }
    }
}

/* Driver code */
int main()
{

cin>>pat;
cin>>txt;
    // we mod to avoid overflowing of value but we should
    // take as big q as possible to avoid the collison
    unsigned int q = 1<<32-1;

    // Function Call
    search(pat, txt, q);

    cout<<cnt<<'\n';
    for(int i=0;i<cnt;i++)
        cout<<a[i]<<' ';
    return 0;
}

// This is code is contributed by rathbhupendra