//ALEX ENACHE

#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>

using namespace std;

//-----------------------------------------------------------------

#include <fstream>

//ifstream cin("input"); ofstream cout("output");
ifstream cin("strmatch.in"); ofstream cout("strmatch.out");

const unsigned long long base = 167;
unsigned long long H[2000100];
vector < int > ans;


int main() {

	string a, b;
	cin >> a >> b;

	int cont = 0;

	unsigned long long caut = 0;
	for (auto& x : a) {
		caut *= base;
		caut += x;
	}

	unsigned long long put = 1;
	for (int i = 1; i <= a.size(); i++) {
		put *= base;
	}

	for (int i = 1; i <= b.size(); i++) {
		
		H[i] = H[i - 1] * base;
		H[i] += b[i - 1];
		
		if (i < a.size()) {
			continue;
		}

		unsigned long long hash = H[i] - H[i - a.size()] * put;

		if (hash == caut) {
			cont++;
			if (ans.size() < 1000) {
				ans.push_back(i - a.size());
			}
		}
	}

	cout << cont << '\n';
	for (auto& x : ans) {
		cout << x << " ";
	}


	return 0;
}