#include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int N = 5005;
char s[N], t[N];
int f[N][N];
int n, m, w[N];
int fir[26], las[26];
void cmin(int &x, int y) {
	if (y < x) x = y;
}
signed main() {
	cin >> (s + 1) >> (t + 1), n = strlen(s + 1), m = strlen(t + 1);
	for (int i = 1; i <= n; i++) {
		cin >> w[i];
	}
	fill(las, las + 26, 1e9);
	for (int i = 1; i <= m; i++) {
		if (!fir[t[i] - 'a']) fir[t[i] - 'a'] = i;
		las[t[i] - 'a'] = i;
	}
	memset(f, 0x3f, sizeof f);
	f[0][0] = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j <= m; j++) {
			if (j < m && t[j + 1] == s[i + 1]) cmin(f[i + 1][j + 1], f[i][j]);
			if (j <= fir[s[i + 1] - 'a'] || j >= las[s[i + 1] - 'a']) cmin(f[i + 1][j], f[i][j] + w[i + 1]);
		}
	}
	if (f[n][m] > 1e18) cout << "You better start from scratch man..." << "\n";
	else cout << f[n][m] << "\n";
	return 0;
}