#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool chk[501][101][50][50];
pair<mint, mint> dp[501][101][50][50];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int l, k; cin >> l >> k;
	string s0, s1; cin >> s0 >> s1;
	vector<mint>p(26);
	{
		vector<int>a(26);
		mint sum = 0;
		rep(i, 26)cin >> a[i], sum += a[i];
		rep(i, 26)p[i] = a[i] / sum;
	}
	auto dfs = [&](auto &&self, int t, int d, int p0, int p1)->pair<mint, mint> {
		if (chk[t][d][p0][p1]) {
			return dp[t][d][p0][p1];
		}
		if (l * 2 == d) {
			return { 1,0 };
		}
		if (0 == d) {
			return { 0,1 };
		}
		if (t == k) {
			return { 0,0 };
		}
		mint v0 = 0, v1 = 0;
		rep(i, 26) {
			int nt = t + 1;
			int nd = d;
			int np0 = p0, np1 = p1;
			if (i == ((s0[p0%l]) - 'a')) {
				nd++;
				np0++;
			}
			if (i == ((s1[p1%l]) - 'a')) {
				nd--;
				np1++;
			}
			np0 %= l;
			np1 %= l;
			auto get = self(self, nt, nd, np0, np1);
			v0 += get.first * p[i];
			v1 += get.second * p[i];
		}
		chk[t][d][p0][p1] = true;
		dp[t][d][p0][p1] = { v0,v1 };
		return dp[t][d][p0][p1];
	};
	auto ans = dfs(dfs, 0, l, 0, 0);
	cout << ans.first.val() << " " << ans.second.val() << endl;
	return 0;
}