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

#define B 29
#define mod1 999979
#define mod2 999983

using namespace std;

ifstream cin;
ofstream cout;

vector < int > sol;

string a, b;

int main()
{
    cin.open("strmatch.in");
    cout.open("strmatch.out");

    getline(cin, a);
    getline(cin, b);

    int N = a.size();
    int M = b.size();

    int cod1 = 0;
    int cod2 = 0;
    for(int i = 0; i < N; ++ i)
    {
        cod1 = (cod1 * B + a[i] - 'A') % mod1;
        cod2 = (cod2 * B + a[i] - 'A') % mod2;
    }

    int pw1 = 1;
    int pw2 = 1;
    for(int i = 1; i < N; ++ i)
    {
        pw1 = (pw1 * B) % mod1;
        pw2 = (pw2 * B) % mod2;
    }

    int pre1 = 0;
    int pre2 = 0;
    for(int i = 0; i < N; ++ i)
    {
        pre1 = (pre1 * B + b[i] - 'A') % mod1;
        pre2 = (pre2 * B + b[i] - 'A') % mod2;
    }

    if(cod1 == pre1 && cod2 == pre2) sol.push_back(1);

    for(int i = N; i < M; ++ i)
    {
        pre1 = (pre1 - ((b[i - N] - 'A') * pw1) % mod1 + mod1) % mod1;
        pre2 = (pre2 - ((b[i - N] - 'A') * pw2) % mod2 + mod2) % mod2;

        pre1 *= B;
        pre2 *= B;

        pre1 += b[i] - 'A';
        pre2 += b[i] - 'A';

        pre1 %= mod1;
        pre2 %= mod2;

        if(cod1 == pre1 && cod2 == pre2) sol.push_back(i - N + 1);
    }

    cout << sol.size() << '\n';
    for(int i = 0; i < 1000 && i < sol.size(); ++ i)
        cout << sol[i] << ' ';
    cout << '\n';


    cin.close();
    cout.close();

    return 0;
}