#include<cstdio>
#include<string.h>
#define N 2000005
#define MOD 1299709
#define BASE 62
int contor;
char a[N];
int result[1005];
char b[N];
int ok;
long long t;
int NA, NB;
int powb;
long long str;
inline int convertNo(char z) {
    if (z >='A' && z <= 'Z') {
        return z - 'A';
    }
    else
      if (z >='a' && z <= 'z') {
          return z - 'a' + 26;
      }
      else
       return z - '0' + 52;
}
void init() {
    powb = 1;
    for(int i = 1; i < NA; i++)
     powb = (powb * BASE) % MOD;
    return;
}
int minim(int a, int b) {
    if(a < b) return a;
    return b;
}
int checkeq(int i) {
    ok = 1;
    for(int j = i; j < i + NA; j++)
       if(b[j] != a[j - i]) ok = 0;
         if(ok == 1) {
            contor++;
            if (contor <= 1000)
                result[contor] = i;
        }
}
int main() {
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    scanf("%s",&a);
    scanf("%s",&b);
    NA = strlen(a);
    NB = strlen(b);
    init();
    for(int i = 0; i < NA; i++) {
        t = ((t * BASE % MOD)  + convertNo(a[i])) % MOD;
        str = ((str * BASE % MOD)  + convertNo(b[i])) % MOD;
    }
    if(str == t)
     checkeq(0);
    for(int i = 1; i <= NB - NA + 1; i++) {
        str = ((str - (powb * convertNo(b[i-1])) % MOD + MOD) * BASE + convertNo(b[i + NA - 1])) % MOD;
        if(str == t)
            checkeq(i);
    }
    printf("%d\n",contor);
    for(int i = 1; i <= minim(contor, 1000); i++)
     printf("%d ", result[i]);
    return 0;
}