/*#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;
}*/

#include <stdio.h>
#include <string.h>

#define MAXN 2000001

#define P 73
#define MOD1 100007
#define MOD2 100021

char A[MAXN], B[MAXN];
int NA, NB;

int hashA1, hashA2, P1, P2;

char match[MAXN];

int main()
{
    freopen("strmatch.in", "rt", stdin);
    freopen("strmatch.out", "wt", stdout);
    
    scanf("%s %s", A, B);
    NA = strlen(A);
    NB = strlen(B);
    
    P1 = P2 = 1;
    hashA1 = hashA2 = 0;
    for (int i = 0; i < NA; i++)
    {
        hashA1 = (hashA1 * P + A[i]) % MOD1;
        hashA2 = (hashA2 * P + A[i]) % MOD2;
        
        if (i != 0)
            P1 = (P1 * P) % MOD1,
            P2 = (P2 * P) % MOD2;
    }
    
    if (NA > NB)
    {
        printf("0\n");
        return 0;
    }
    
    int hash1 = 0, hash2 = 0;
    for (int i = 0; i < NA; i++)
        hash1 = (hash1 * P + B[i]) % MOD1,
        hash2 = (hash2 * P + B[i]) % MOD2;
    
    int Nr = 0;
    if (hash1 == hashA1 && hash2 == hashA2)
        match[0] = 1, Nr++;
    
    for (int i = NA; i < NB; i++)
    {
        hash1 = ((hash1 - (B[i - NA] * P1) % MOD1 + MOD1) * P + B[i]) % MOD1;
        hash2 = ((hash2 - (B[i - NA] * P2) % MOD2 + MOD2) * P + B[i]) % MOD2;
        
        if (hash1 == hashA1 && hash2 == hashA2)
            match[ i - NA + 1 ] = 1, Nr++;
    }
    printf("%d\n", Nr);
    
    Nr = 0;
    for (int i = 0; i < NB && Nr < 1000; i++)
        if (match[i])
            Nr++,
            printf("%d ", i);
    printf("\n");
    
    return 0;
}