#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
//#include <windows.h>
#include <deque>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
vector<int> x[1000007];
const int MEX = 1000003;
void has(string p, int n)
{
    int num = 1, seed = 13, val = 0;
    for(int i = 0; i < n; i++)
    {
        val = (val + (((p[i] - 52) * num) % MEX + MEX)) % MEX;
        num = (num * seed) % MEX;
    }
    num /= 13;
    x[val].push_back(0);
    for(int i = n; i < p.size(); i++)
    {
        val -= (p[i - n] - 52 + MEX) % MEX;
        val /= 13;
        val += ((p[i] - 52) * num + MEX) % MEX;
        x[val].push_back(i - n + 1);
    }
}
int main()
{
    string s, p;
    cin >> s >> p;
    has(p, s.size());
    int val = 0, num = 1, seed = 13;
    for(int i = 0; i < s.size(); i++)
    {
        val = (val + (((s[i] - 52) * num) % MEX + MEX)) % MEX;
        num = (num * seed) % MEX;
    }
    cout << x[val].size() << "\n";
    for(int i = 0; i < x[val].size(); i++)
        cout << x[val][i] << " ";
    return 0;
}