#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#include <unordered_set>
#include <array>
#define int long long
#define pb push_back
#define fir first
#define sec second
#define double long double
#define endl "\n"
#define un unsigned
#define INF 999999999999
#define EPS 0.000000000001
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;

string mini(string a, string b)
{
    if ((a.size() <= b.size() && a != "$") || b == "$")
    {
        return a;
    }

    return b;
}

int check(char c)
{
    if (c == '*')
    {
        return 2;
    }

    if (c == '?')
    {
        return 1;
    }

    return 0;
}

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

    string a, b;
    cin >> a >> b;

    int n = a.size() + 1;
    int m = b.size() + 1;

    a = "0" + a;
    b = "0" + b;

    vector<vector<string>> dp(n, vector<string>(m));

    dp[0][0] = "0";

    // $ -- no solution

    for (int i = 1; i < n; i++)
    {
        if (a[i] == '*' && dp[i - 1][0] != "$")
        {
            dp[i][0] = dp[i - 1][0];
        }
        else
        {
            dp[i][0] = "$";
        }
    }

    for (int i = 1; i < m; i++)
    {
        if (b[i] == '*' && dp[0][i - 1] != "$")
        {
            dp[0][i] = dp[0][i - 1];
        }
        else
        {
            dp[0][i] = "$";
        }
    }

    for (int i = 1; i < n; i++)
    {
        for (int j = 1; j < m; j++)
        {
            if (a[i] == b[j] && a[i] != '*' && a[i] != '?')
            {
                dp[i][j] = dp[i - 1][j - 1] + a[i];
            }
            else if (a[i] == b[j] && a[i] == '*')
            {
                dp[i][j] = mini(dp[i][j - 1], dp[i - 1][j]);
            }
            else if (a[i] == b[j] && a[i] == '?')
            {
                dp[i][j] = dp[i - 1][j - 1] + "a";
            }

            if (dp[i][j] != "" && dp[i][j][0] == '$')
            {
                dp[i][j] = "$";
            }

            if (dp[i][j] != "")
            {
                continue;
            }

            if (check(a[i]) == 0)
            {
                if (check(b[j]) == 1)
                {
                    dp[i][j] = dp[i - 1][j - 1] + a[i];
                }
                else if (check(b[j]) == 2)
                {
                    string lol = mini(dp[i - 1][j], dp[i][j - 1]);

                    if (lol == dp[i][j - 1])
                    {
                        dp[i][j] = lol;
                    }
                    else
                    {
                        dp[i][j] = lol + a[i];
                    }
                }
                else
                {
                    dp[i][j] = "$";
                }
            }

            if (check(a[i]) == 1)
            {
                if (check(b[j]) == 0)
                {
                    dp[i][j] = dp[i - 1][j - 1] + b[j];
                }
                else
                {
                    string lol = mini(dp[i - 1][j], dp[i][j - 1]);

                    if (lol == dp[i][j - 1])
                    {
                        dp[i][j] = lol;
                    }
                    else
                    {
                        dp[i][j] = lol + "a";
                    }
                }
            }

            if (check(a[i]) == 2)
            {
                if (check(b[j]) == 0)
                {
                    string lol = mini(dp[i - 1][j], dp[i][j - 1]);

                    if (lol == dp[i - 1][j])
                    {
                        dp[i][j] = lol;
                    }
                    else
                    {
                        dp[i][j] = lol + b[j];
                    }
                }
                else
                {
                    string lol = mini(dp[i - 1][j], dp[i][j - 1]);

                    if (lol == dp[i - 1][j])
                    {
                        dp[i][j] = lol;
                    }
                    else
                    {
                        dp[i][j] = lol + "a";
                    }
                }
            }

            if (dp[i][j][0] == '$')
            {
                dp[i][j] = "$";
            }

            dp[i][j];
        }
    }


    if (dp[n - 1][m - 1] == "$")
    {
        cout << "No solution!";
    }
    else
    {
        for (int i = 1; i < dp[n - 1][m - 1].size(); i++)
        {
            cout << dp[n - 1][m - 1][i];
        }
    }

    return 0;
}