#include <bits/stdc++.h>
// #define int long long
#define inf 0x3f3f3f3f
#define ll long long
#define pii pair<int, int>
#define tii tuple<int, int, int>
#define db double
#define all(a) a.begin(), a.end()
using namespace std;
const int maxn = 3e5 + 10;
const int mod = 998244353;
bitset<maxn> bs[27];
void solve() {
    string s, t; cin >> s >> t;
    for (int i = 0; i < t.length(); i++) {
        if (t[i] == '*') {
            for (int j = 0; j < 26; j++)
                bs[j][i] = 1;
        }
        else bs[t[i] - 'a'][i] = 1;
    }
    bitset<maxn> cur;
    for (int i = 1; i <= t.length(); i++)
        cur[i] = 1;
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == '*') continue;
        cur &= bs[s[i] - 'a'] << ((int)s.length() - i);
    }
    for (auto it = cur._Find_first(); it != maxn; it = cur._Find_next(it))
        cout << it - s.length() + 1 << " ";
}
signed main() {
    // freopen("1.in", "r", stdin);
    // freopen("1.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}