#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long int64;
string __fname = "strmatch"; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
#define cin in 
#define cout out
#define sz(x)(int) x.size()
#define pb(x) push_back(x)
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define ss cout << " "
#define nn cout << "\n"
#define ct(x) cout << (x)
#define cts(x) cout << (x) << " "
#define ctn(x) cout << (x) << "\n"
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
#define rt return
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
int64 ceildiv(int64 a, int64 b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int maxn = 200200;
const int64 mod = 1000000007;
const int64 hp = 101;
const int64 hinv = 940594066;
const double pi = 3.14159265359;
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

void solve(int id){

    rt;
}

int64 haash (string s) {
    int64 ha = 0;
    int64 p = 1; 
    for (int i = 0; i < sz(s); i++){
        ha = (ha + s[i] * p) % mod;
        p = (p * hp) % mod;
    }
    return ha;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); ct(fixed); ct(setprecision(10)); 
    string a,b;
    cin >> a >> b;
    int n = sz(b), m = sz(a);
    int64 ha = 0;
    int64 hb = 0;
    int64 p = 1; 
    int64 pw = 0;
    for (int i = 0; i < m; i++){
        ha = (ha + a[i] * p) % mod;
        hb = (hb + b[i] * p) % mod;
        pw = p;
        p = (p * hp) % mod;
    }
    vector <int> rs;
    for (int i = 0; i <= n - m; i++){
        string l = "";
        for (int j = i; j < i + m; j++){
            l.pb(b[j]);
        }
        if (ha == hb){
            rs.pb(i);
        }
        if (i != n - m) {
            hb = (hb - b[i] + mod) % mod;
            hb = (hb * hinv) % mod;
            hb = (hb + b[i + m] * pw) % mod;
        }
    }
    ctn(sz(rs));
    for (auto i: rs) {
        cts(i);
    }
    rt 0;
}