#include <iostream>
#include <cstring>
#include <vector>
using namespace std;


const int NMAX = 2e5 + 1;

char s[NMAX],t[NMAX]; int pi[NMAX];

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

int main() {

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

	fgets(s, sizeof(s), stdin);
	fgets(t, sizeof(t), stdin);

    int j = 0; vector<int> ans; int n = strlen(t + 1),m = strlen(s + 1);
    for(int i = 1; i <= n ; i++)
        {
            if(ans.size() >= 1000) break;
            while(j && t[i] != s[j + 1]) j = pi[j];
            if(t[i] == s[j + 1]) j++;
            if(j == m)
                {
                    ans.emplace_back(i - j);
                    j = pi[strlen(s + 1)];
                }
        }

    while(ans.size() > 1000) ans.pop_back();
    cout << ans.size() << '\n'; for(auto it : ans) cout << it << " ";
    return 0;
}