#include <fstream>
#include <string>
#include <vector>

using namespace std;

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

static constexpr int NMAX = ((int)(2e6) + 1);

string a = "", b = "", s = "";

int length[(NMAX << 1)];

static inline void read()
{
    f.tie(nullptr);

    f >> a >> b;

    s = "#" + a + "#" + b;

    return;
}

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

int main()
{
    read();

    int n = (int)s.size() - 1;

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

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

        while ((i + length[i] <= n) && s[i + length[i]] == s[length[i] + 1])
            ++length[i];

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

    vector<int> ans = {};

    int first_string_size = (int)a.size();
    for (int i = first_string_size + 2; i <= n; ++i)
        if (length[i] == first_string_size)
            ans.push_back(i - first_string_size - 2);

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

    if (ans.empty())
        return 0;

    int m = my_min((int)ans.size(), (int)(1e3));

    for (int i = 0; i < m; ++i)
    {
        g << ans[i];

        if (i != (m - 1))
            g << ' ';
        else
            g << '\n';
    }

    return 0;
}