#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
struct hassh {
	int n, p, m;
	vector<int> pref_hash;
	vector<int> power;
	void build(string s, int pp, int mm) {
		p = pp;
		m = mm;
		int n = (int)s.size() - 1;
		pref_hash = power = vector<int>(n + 1);
		power[0] = 1;
		for (int i = 1; i <= n; ++i) {
			power[i] = (1ll * power[i - 1] * p) % m;
		}
		for (int i = 1; i <= n; ++i) {
			pref_hash[i] = (pref_hash[i - 1] + (1ll * power[i - 1] * (s[i] - 'a' + 1)) % m) % m;
		}
	}
	bool query(int st1, int dr1, int st2, int dr2) {
		if (st1 > st2) {
			swap(st1, st2);
			swap(dr1, dr2);
		}
		int x = (1ll * (pref_hash[dr1] - pref_hash[st1 - 1] + m) % m * power[st2 - st1]) % m;
		int y = (pref_hash[dr2] - pref_hash[st2 - 1] + m) % m;
		return (x == y);
	}
};
int main() {
	string a, b;
	fin >> b >> a;
	a = '$' + a;
	int n = a.size() - 1;
	int m = b.size();
	string c = a + b;
	hassh h;
	h.build(c, 53, 950000009);
	vector<int> ans;
	for (int i = n + 1; i <= n + m; ++i) {
		cout << c[i];
	}
	for (int i = 1; i <= n-m+1; ++i) {
		int st = i, dr = i + m - 1;
		if (h.query(st, dr, n + 1, n + m)) {
			ans.push_back(i - 1);
			if ((int)ans.size() == 1000) {
				break;
			}
		}
	}
	fout << (int)ans.size() << '\n';
	for (auto i : ans) {
		fout << i << ' ';
	}
}