#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <list>
#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 fi first
#define se second
#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 : _sign = 1 ;
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

template <class T>
void WriteNo(T _value, char _ch = ' ') {
	cout << _value << _ch;
}

string A, B;

int main(){
	string fileInput = "strmatch";
#ifdef INFOARENA
	freopen((fileInput + ".in").c_str(), "r", stdin);
	freopen((fileInput + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/input", "r", stdin);
#endif
#endif
	
	int i, lg1, lg2, ans_cnt = 0;
	ULL hash1 = 0, hash2 = 0, bbase = 1;
	vector<int> ans;
	cin >> A >> B;
	lg1 = A.length();
	lg2 = B.length();
	
	if (lg1 > lg2) {
		WriteNo(0, '\n');
		return 0;
	}
	
	for (i = 0; i < lg1; ++i) {
		hash1 = hash1 * BASE + A[i];
		i > 0 ? bbase *= BASE : 0;
	}
	for (i = 0; i < lg1; ++i) {
		hash2 = hash2 * BASE + B[i];
	}
	
	if (hash1 == hash2) {
		ans.pb(1);
		ans_cnt = 1;
	}
	
	for (i = lg1; i < lg2; ++i) {
		hash2 = hash2 - bbase * B[i - lg1];
		hash2 = hash2 * BASE + B[i];
		if (hash1 == hash2) {
			++ans_cnt;
			if (ans_cnt <= 1000) {
				ans.pb(i - lg1 + 1);
			}
		}
	}
	
	WriteNo(ans_cnt, '\n');
	for (auto it: ans) {
		WriteNo(it);
	}
	ENTER;
	
	
	
	return 0;
}