#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, x, y, l, r, mirror, cnt, N, sol[nmax], z[2 * nmax];
char a[2 * 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);
    N = n;

    a[++n] = '$';
    for(i = 1; i <= m; i++)
        a[++n] = b[i];

    l = r = 0;
    for(i = 2; i <= n; i++)
    {
        if(i > r)
        {
            for(x = 0, y = i - 1; y < n && a[x + 1] == a[y + 1]; x++, y++);

            z[i] = x;
            if(z[i])
            {
                l = i;
                r = y;
            }
        }
        else
        {
            mirror = i - l + 1;

            if(i + z[mirror] - 1 < r)
                z[i] = z[mirror];
            else
            {
                for(x = r - i + 1, y = r; y < n && a[x + 1] == a[y + 1]; x++, y++);

                z[i] = y - i + 1;
                l = i;
                r = y;
            }
        }

        if(z[i] == N)
            if(++cnt <= 1000)
                sol[cnt] = i - N - 2;
    }

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

    return 0;
}