#include <fstream>
#include <cstring>

#define P      73
#define MOD1   100007
#define MOD2   100021

using namespace std;

char A[2000001], B[2000001];
char match[2000001];
int hashA1, hashA2, P1, P2;

int main()
{
    ifstream f("strmatch.in");
    ofstream g("strmatch.out");
    int NA, NB, hash1 = 0, hash2 = 0, nr = 0, nr1 = 0;

    f >> A >> B;
    NA = strlen(A);
    NB = strlen(B);

    P1 = P2 = 1;
    hashA1 = hashA2 = 0;
    for (int i = 0; i < NA; i++)
    {
        hashA1 = (hashA1 * P + A[i]) % MOD1;
        hashA2 = (hashA2 * P + A[i]) % MOD2;
        if (i != 0)
        {
            P1 = (P1 * P) % MOD1;
            P2 = (P2 * P) % MOD2;
        }
    }

    if (NA > NB)
    {
        g << 0 << "\n";
        return 0;
    }

    for (int i = 0; i < NA; i++)
    {
        hash1 = (hash1 * P + B[i]) % MOD1;
        hash2 = (hash2 * P + B[i]) % MOD2;
    }

    if (hash1 == hashA1 && hash2 == hashA2)
    {
        match[0] = 1;
        nr++;
    }

    for (int i = NA; i < NB; i++)
    {
        hash1 = ((hash1 - (B[i - NA] * P1) % MOD1 + MOD1) * P + B[i]) % MOD1;
        hash2 = ((hash2 - (B[i - NA] * P2) % MOD2 + MOD2) * P + B[i]) % MOD2;
        if (hash1 == hashA1 && hash2 == hashA2)
        {
            match[i - NA + 1] = 1;
            nr++;
        }
    }

    g << nr << "\n";
    for (int i = 0; i < NB && nr1 < 1000; i++)
    {
        if (match[i])
        {
            g << i << " ";
            nr1++;
        }
    }
    g << "\n";

    f.close();
    g.close();
    return 0;
}