#include <bits/stdc++.h>
#include <algorithm>
using namespace std;

int phi[4000001];
vector <int> sol;
class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
int main()
{ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n,m,i;
    string s,b;
    cin >> s >> b;    int cv = s.size();

    s += "#";
    s += b;
    n = s.size();
    for(i = 1;i < n;i++){
        int j = phi[i-1];
        while(s[i] != s[j] && j > 0){
            j = phi[j - 1];
        }
        if(s[i] == s[j]){
            j++;
        }
        phi[i] = j;
        if(phi[i] == cv){
            sol.push_back(i - 2 * cv);
        }
    }
    cout << sol.size() << "\n";
    for(auto x : sol)
        cout << x << " ";
    return 0;
}