#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int nmax = 2000005;

int n, m, i, q,cnt, sol[nmax], pi[nmax];
char a[nmax], b[nmax];

int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    scanf("%s", a + 1);
    scanf("%s", b + 1);

    n = strlen(a + 1);
    m = strlen(b + 1);

    for(i = 2; i <= n; i++)
    {
        while(q && a[q + 1] != a[i])
            q = pi[q];

        if(a[q + 1] == a[i])
            q++;

        pi[i] = q;
    }

    q = 0;
    for(i = 1; i <= m; i++)
    {
        while(q && a[q + 1] != b[i])
            q = pi[q];

        if(a[q + 1] == b[i])
            q++;

        if(q == n)
            if(++cnt <= 1000)
                sol[cnt] = i - n;
    }

    printf("%d\n", cnt);
    for(i = 1; i <= min(cnt, 1000); i++)
        printf("%d ", sol[i]);

    return 0;
}