#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;
    for (j = 0, 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;
    for (j = 0, 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)
        {
            if (sol.size() < 1000) sol.push_back(i-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;
}