#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;
}

char word[2000001], text[2000001];
pair <int, int> w_hash, t_hash;
int mod1 = 666013, mod2 = 1000000007, nr_pos;
int power1, power2;
vector <int> solution;

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, lg_word, lg_text, start_pos;
	
	scanf("%s %s", word, text);
	
	lg_word = strlen(word);
	lg_text = strlen(text);
	
	if (lg_text < lg_word) {
		printf("0\n");
		return 0;
	}
	
	w_hash = mp(word[0], word[0]);
	t_hash = mp(text[0], text[0]);
	power1 = power2 = 1;
	
	for (i = 1; i < lg_word; ++i) {
		w_hash.first = ((LL)w_hash.first * BASE + word[i]) % mod1;
		w_hash.second = ((LL)w_hash.second * BASE + word[i]) % mod2;
		
		t_hash.first = ((LL)t_hash.first * BASE + text[i]) % mod1;
		t_hash.second = ((LL)t_hash.second * BASE + text[i]) % mod2;
		
		power1 = (power1 * BASE) % mod1;
		power2 = (power2 * BASE) % mod2;
	}
	
	if (w_hash == t_hash) {
		++nr_pos;
		solution.pb(0);
	}
	
	for (i = lg_word; i < lg_text; ++i) {
		start_pos = i - lg_word;
		t_hash.first = (((LL)t_hash.first + mod1 - (text[start_pos] * power1) % mod1) * BASE + text[i]) % mod1;
		t_hash.second = (((LL)t_hash.second + mod2 - (text[start_pos] * power2) % mod2) * BASE + text[i]) % mod2;
		
//		hashB1 = ((hashB1 + MOD1 - (B[i - lgA] * fact1) % MOD1) * base + B[i]) % MOD1;
//		hashB2 = ((hashB2 + MOD2 - (B[i - lgA] * fact2) % MOD2) * base + B[i]) % MOD2;
		
		if (w_hash == t_hash) {
			++nr_pos;
			if (nr_pos <= 1000) {
				solution.pb(start_pos + 1);
			}
		}
	}
	
	printf("%d\n", nr_pos);
	for (auto p: solution) {
		printf("%d ", p);
	}
	
	return 0;
}