#include <bits/stdc++.h>

using namespace std;

const int Nmax = 2000010;

int n , m , ans;
int pi[Nmax];
char a[Nmax] , b[Nmax];

vector < int > sol;

void makePrefix()
{
    int i , j = 0;
    for (i = 2; i <= n; ++i)
    {
        while (j && a[j+1] != a[i]) j = pi[j];
        if (a[j+1] == a[i]) j++;
        pi[i] = j;
    }
}

void makeKmp()
{
    int i , j = 0;
    for (i = 1; i <= m; ++i)
    {
        while (j && a[j+1] != b[i]) j = pi[j];
        if (a[j+1] == b[i]) j++;
        if (j == n && sol.size() < 1000) sol.push_back(i-n);
        if (j == n) ans++;
    }
}


int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);

    gets(a+1); n = strlen(a+1);
    gets(b+1); m = strlen(b+1);

    makePrefix(); makeKmp();

    printf("%d\n", ans);
    for (auto &it : sol) printf("%d ", it);

    return 0;
}