#include <fstream>
#include <cstring>
#define MAX 2000000
using namespace std;
ifstream cin ("strmatch.in");
ofstream cout ("strmatch.out");
char s1[MAX + 10], s2[MAX + 10], s[MAX + 10];
int pi[MAX + 10];
void kmp()
{
    int k = 0, sz = strlen(s);
    pi[0] = 0;
    for (int i = 1; i < sz; i++)
    {
        while (k != 0 && s[k] != s[i])
            k = pi[k - 1];
        if (s[k] == s[i])
            k++;
        else
            k = 0;
        pi[i] = k;
    }
}
int main()
{
    cin >> s1 >> s2;
    strcpy(s, s1);
    strcat(s, "#");
    strcat(s, s2);
    kmp();
    int cnt = 0, l1 = strlen(s1), l = strlen(s);
    for (int i = l1 + 1; i < l; i++)
        if (pi[i] == l1)
            cnt++;
    cout << cnt << '\n';
    cnt = 0;
    for (int i = l1 + 1; i < l; i++)
        if (pi[i] == l1 && cnt <= 1000)
        {
            cnt++;
            cout << i - 2 * l1 << ' ';
        }
    return 0;
}