#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define int ll
const int N = 2e5 + 10, mod = 1e9 + 7;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    string s, p;
    cin >> p >> s;
    int n = p.size();
    p = p + '#' + s; 
    // cout<<p<<endl;
    vector<int> ne(p.size() + 1);
    for (int i = 1; i < n; i++) {
    	int j = ne[i - 1];
    	while (j && p[i] != p[j]) j = ne[j - 1];
        if (p[i] == p[j]) j++; 
        ne[i] = j;
    }
    for (int i = n + 1; i < p.size(); i++) {
        int j = ne[i - 1];
        while (j && p[i] != p[j] && p[i] != '*' && p[j] != '*') j = ne[j - 1];
        cout <<p[i]<<' '<< p[j]<<endl;
        if ((p[i] == p[j] || p[i] == '*' || p[j] == '*') && p[i] != '#' && p[j] != '#') j++; 
        ne[i] = j;
        // cout<<i<<' '<<ne[i-1]<<'|'<<endl;
        if(ne[i] == n) cout << i - 2 - n << ' ';
    } 

    return 0;
}