#include <fstream>
#include <vector>

using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");

static constexpr int NMAX = (((int)(2e6) << 1) + 2);
int max_pref[NMAX];

static inline int my_min(int a, int b)
{
    return ((a < b) ? a : b);
}

int main()
{
    string a = "", b = "";
    f >> a >> b;

    string S = "#" + a + "#" + b;
    int n = (int)S.size() - 1;

    max_pref[1] = n;
    int left = 0, right = 0;

    for (int i = 2; i <= n; ++i)
    {
        if (left <= i && i <= right)
            max_pref[i] = my_min(max_pref[i - left + 1], right - i + 1);
        else max_pref[i] = 0;

        while (i + max_pref[i] <= n && S[i + max_pref[i]] == S[max_pref[i] + 1])
            ++max_pref[i];

        if (i + max_pref[i] - 1 >= right)
            left = i, right = i + max_pref[i] - 1;
    }

    vector<int> sol;

    int n_a = (int)a.size();

    for (int i = n_a + 2; i <= n; ++i)
        if (max_pref[i] == n_a)
            sol.push_back(i - (n_a + 2));

    g << (int)sol.size() << '\n';

    int up_to = my_min((int)1e3, (int)sol.size());

    for (int i = 0; i < up_to; ++i)
    {
        g << sol[i];

        if (i < (up_to - 1))
            g << ' ';
        else
            g << '\n';
    }

    return 0;
}