//ALEX ENACHE

#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>

using namespace std;

//#include <iostream>
#include <fstream>
ifstream cin ("strmatch.in");ofstream cout ("strmatch.out");

int kmp[4000100];
vector < int > pos;

int main() {

    //freopen("input", "r", stdin);freopen("output", "w", stdout);

    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    string a , b , s;
    cin>>a>>b;
    int l = a.size();
    s = a + '#' + b;
    int cont = 0;
    kmp[0] = -1;
    for (int i=1; i<s.size(); i++){
        int last = kmp[i-1];
        while (last != -1 && s[last] != s[i]){
            last = kmp[max(last-1 , 0)];
        }
        kmp[i] = last + 1;
        //cout<<i<<" "<<s[i]<<" "<<kmp[i]<<'\n';
        if (kmp[i] == l){
            cont++;
            if (cont < 1000){
                pos.push_back(i-2*l);
            }
        }
    }

    cout<<cont<<'\n';
    for (auto &x : pos){
        cout<<x<<" ";
    }

    return 0;
}