#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize ("O1")
#pragma GCC optimize ("O2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")

using namespace std;
using namespace __gnu_pbds;

#define ordered_set tree <long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update>
#define lsb(x)(x & (-x))

const int max_size = 2e6 + 20, INF = 1e9 + 2;

string a, b;
int p[max_size];

void kmp ()
{
    int q = 0;
    for (int i = 2; i < a.size(); i++)
    {
        while (q > 0 && a[q + 1] != a[i])
        {
            q = p[q];
        }
        if (a[q + 1] == a[i])
        {
            q++;
        }
        p[i] = q;
    }
}

void solve ()
{
    cin >> a >> b;
    a = '$' + a;
    b = '$' + b;
    kmp();
    vector <int> pl;
    int ans = 0, q = 0;
    for (int i = 1; i < b.size(); i++)
    {
        while (q > 0 && a[q + 1] != b[i])
        {
            q = p[q];
        }
        if (a[q + 1] == b[i])
        {
            q++;
        }
        if (q == a.size() - 1)
        {
            ans++;
            if (ans <= 1000)
            {
                pl.push_back(i - a.size() + 1);
            }
        }
    }
    cout << ans << '\n';
    for (auto f : pl)
    {
        cout << f << " ";
    }
    cout << '\n';
}

signed main ()
{
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#else
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    long long tt;
    //cin >> tt;
    tt = 1;
    while (tt--)
    {
        solve();
    }
    return 0;
}