//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 z[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;
    int C = 0 , R = 0;
    for (int i=2; i<s.size(); i++){
        z[i] = max((min(z[i-C+1] , R - i - 1)) , 0);
        while (s[z[i] + 1] == s[i + z[i]]){
            z[i] ++;
        }
        //cout<<i<<" "<<s[i]<<" "<<z[i]<<'\n';
        if (z[i] == l){
            cont++;
            if (cont <= 1000){
                pos.push_back(i - l - 2);
            }
        }
        if (R < i + z[i]){
            C = i;
            R = i + z[i];
        }
    }

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

    return 0;
}