#ifdef ONLINE_JUDGE
	#include <bits/stdc++.h>
#else
	#include <algorithm>
	#include <bitset>
	#include <cassert>
	#include <cmath>
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#include <iostream>
	#include <map>
	#include <set>
	#include <stack>
	#include <string>
	#include <utility>
	#include <vector>
	#include <queue>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

int lg_text, lg_word, nr_pos;
char word[2000002], text[2000002];
vector <int> fail, solution;

void BuildFail(char* word) {
	int i, k;
	k = 0;
	
	for (i = 1; i < lg_word; ++i) {
		while (k && word[i + 1] != word[k + 1]) {
			k = fail[k];
		}
		
		if (word[i + 1] == word[k + 1]) {
			++k;
		}
		
		fail[i + 1] = k;
	}
}

int main(){
	string file_input = "strmatch";
#ifdef INFOARENA
	freopen((file_input + ".in").c_str(), "r", stdin);
	freopen((file_input + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("input.cpp", "r", stdin);
#endif
#endif
	
	int i, k;
	
//	cin >> word; word = " " + word;
//	cin >> text; text = " " + text;
	cin >> (word + 1);
	cin >> (text + 1);
	
	lg_text = strlen(text + 1);
	lg_word = strlen(word + 1);
	
	fail.resize(lg_word + 1);
	
	BuildFail(word);
	
	k = 0;

	for (i = 0; i < lg_text; ++i) {
		while(k && text[i + 1] != word[k + 1]) {
			k = fail[k];
		}
		
		if (text[i + 1] == word[k + 1]) {
			++k;
			if (k == lg_word) {
				++nr_pos;
				if (nr_pos <= 1000) {
					solution.pb(i - lg_word + 1);
				}
				k = fail[k];
			}
		}
	}
	
	printf("%d\n", nr_pos);
	for (auto x: solution) {
		printf("%d ", x);
	}
	return 0;
}