#include<fstream>
#include<vector>
#include<cstring>
#define MAXN 2000002
#define SOLSIZE 1000

using namespace std;

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

char c, WORD[MAXN];
int PI[MAXN+1], wordlen;

void process() {
    fin>>WORD[1];
    int i, cnd = 0;
    for(i=2; fin>>noskipws>>WORD[i], WORD[i] != '\n';i++) {
        while(cnd && WORD[i] != WORD[cnd+1])
            cnd = PI[cnd];
        if(WORD[cnd + 1] == WORD[i])
            cnd++;
        PI[i] = cnd;
    }
    WORD[i] = 0;
    wordlen = i-1;
}

vector<int> SOL;
int ap;

void search() {
    int cnd = 0;
    for(int i=0; fin>>noskipws>>c, c != '\n';i++) {
        while(cnd && c != WORD[cnd+1])
            cnd = PI[cnd];
        if(WORD[cnd+1] == c) {
            cnd++;
            if(cnd == wordlen) {
                ap++;
                if(SOL.size() <= SOLSIZE)
                    SOL.push_back(i);
            }
        }
    }
}

void afis() {
    fout<<ap<<'\n';
    for(vector<int>::iterator it=SOL.begin(); it!=SOL.end(); ++it) {
        fout<<*it - wordlen + 1<<" ";
    }
}

int main() {
    process();
    search();
    afis();
    return 0;
}