#pragma GCC optimize("fast-math")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define vmax 2000005
using namespace std;
char a[vmax], b[vmax];
int n, m, st, dr, z[2 * vmax + 5], u, nr, v[500005];
char t[2 * vmax + 5];
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int32_t main()
{
    fin.tie(0);
    fout.tie(0);
    fin >> b;
    fin >> a;
    n = strlen(a), m = strlen(b);
    for(int i = 0; i < m; ++i)
    {
        t[i] = b[i];
    }
    t[m] = '#';
    for(int i = 0; i < n; ++i)
    {
        t[i + m + 1] = a[i];
    }
    n = n + m + 1;
    for(int k = 1; k < n; ++k)
    {
        if(k > dr)
        {
            st = dr = k;
            while(dr < n && t[dr] == t[dr - st])
            {
                dr++;
            }
            z[k] = dr - st;
            dr--;
        }
        else
        {
            u = k - st;
            if(k + z[u] <= dr)
            {
                z[k] = z[u];
            }
            else
            {
                st = k;
                while(dr < n && t[dr] == t[dr - st])
                {
                    dr++;
                }
                z[k] = dr - st;
                dr--;
            }
        }
        if(z[k] == m)
        {
            nr++;
            v[nr] = k - m - 1;
        }
    }
    fout << nr << '\n';
    nr = min(1000, nr);
    for(int i = 1; i <= nr; ++i)
    {
        fout << v[i] << " ";
    }
    return 0;
}