#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(unsigned long long a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
//using mint = prime_modint<1000000007>;
using mint = prime_modint<998244353>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int l, k;
    cin >> l >> k;
    string s, t;
    cin >> s >> t;
    vector<int> a(26);
    for(auto &&v : a) cin >> v;
    int tot = accumulate(a.begin(), a.end(), 0);
    vector<mint> coef(26);
    for(int i = 0; i < 26; i++){
        coef[i] = mint(a[i]) / tot;
    }
    mint A, B;
    vector dp(1, vector<mint>(1));
    dp[0][0] = 1;
    for(int i = 0; i < k; i++){
        vector ndp(i + 2, vector<mint>(i + 2));
        for(int j = 0; j <= i; j++){
            int ns = s[j % l] - 'a';
            for(int p = max(0, j - l + 1); p <= i && p < j + l; p++){
                if(dp[j][p] == 0) continue;
                int nt = t[p % l] - 'a';
                for(int n = 0; n < 26; n++){
                    if(coef[n] == 0) continue;
                    int nj = j, np = p;
                    if (n == ns) nj++;
                    if (n == nt) np++;
                    if(nj - np >= l){
                        A += coef[n] * dp[j][p];
                        continue;
                    }
                    if(np - nj >= l){
                        B += coef[n] * dp[j][p];
                        continue;
                    }
                    ndp[nj][np] += coef[n] * dp[j][p];
                }
            }
        }
        swap(dp, ndp);
    }
    cout << A << ' ' << B << '\n';
}