#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

#define MOD1 100007
#define MOD2 100021

void strmatch(string A, string B){
    vector<int> v;
    int p = 26, p1 = 1, p2 = 1;
    
    int hashA1 = 0, hashB1 = 0, hashA2 = 0, hashB2 = 0;
    int sizeA = A.size(), sizeB = B.size();
    
    for(int i = 0; i < sizeA; ++i){
        hashA1 = (hashA1 * p + A[i]) % MOD1;
        hashB1 = (hashB1 * p + B[i]) % MOD1;
        
        hashA2 = (hashA2 * p + A[i]) % MOD2;
        hashB2 = (hashB2 * p + B[i]) % MOD2;
        
        if(i != 0){
            p1 = (p1 * p) % MOD1;
            p2 = (p2 * p) % MOD2;
        }
    }
    
    if(hashA1 == hashB1 && hashA2 == hashB2){
        v.push_back(0);
    }
    
    for(int i = sizeA; i < sizeB; ++i){
        hashB1 = ((hashB1 - (B[i-sizeA] * p1) % MOD1 + MOD1) * p + B[i]) % MOD1;
        hashB2 = ((hashB2 - (B[i-sizeA] * p2) % MOD2 + MOD2) * p + B[i]) % MOD2;
        /*if (hashB1 < 0) {
            hashB1 += MOD1;
        }
        
        if (hashB2 < 0) {
            hashB2 += MOD2;
        }*/
        
        if(hashB1 == hashA1 && hashB2 == hashA2){
            v.push_back(i-sizeA+1);
        }
    }
    
    cout << v.size() << endl;
    int minSize = min((int)v.size(), 1000);
    for(int i = 0; i < minSize; ++i)
        cout << v[i] << " ";
}

int main(){
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out","w", stdout);
    string A, B;
    cin >> A >> B;
    strmatch(A, B);
    
    return 0;
}