#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


template<long long mod>
class modint{
    long long x;
public:
    modint(long long x=0) : x((x%mod+mod)%mod) {}
    modint operator-() const { 
      return modint(-x);
    }
    bool operator==(const modint& a){
        if(x == a) return true;
        else return false;
    }
    bool operator==(long long a){
        if(x == a) return true;
        else return false;
    }
    bool operator!=(const modint& a){
        if(x != a) return true;
        else return false;
    }
    bool operator!=(long long a){
        if(x != a) return true;
        else return false;
    }
    modint& operator+=(const modint& a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    modint& operator-=(const modint& a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    modint& operator*=(const  modint& a) {
        (x *= a.x) %= mod;
        return *this;
    }
    modint operator+(const modint& a) const {
        modint res(*this);
        return res+=a;
    }
    modint operator-(const modint& a) const {
        modint res(*this);
        return res-=a;
    }
    modint operator*(const modint& a) const {
        modint res(*this);
        return res*=a;
    }
    modint pow(long long t) const {
        if (!t) return 1;
        modint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    modint inv() const {
        return pow(mod-2);
    }
    modint& operator/=(const modint& a) {
        return (*this) *= a.inv();
    }
    modint operator/(const modint& a) const {
        modint res(*this);
        return res/=a;
    }

    friend std::istream& operator>>(std::istream& is, modint& m) noexcept {
        is >> m.x;
        m.x %= mod;
        if (m.x < 0) m.x += mod;
        return is;
    }

    friend ostream& operator<<(ostream& os, const modint& m){
        os << m.x;
        return os;
    }
};

using mint = modint<MOD998244353>;

void solve(){
    int L, K; cin >> L >> K;
    string s, t; cin >> s >> t;
    vector<int> a(26);
    mint sum = 0;
    for(int i=0; i<26; i++){
        cin >> a[i];
        sum += mint(a[i]);
    }
    vector<mint> p(26, 0);
    for(int i=0; i<26; i++) p[i] = mint(a[i])/sum;


    vector<vector<vector<mint>>> dp(K+1, vector<vector<mint>>(K+1, vector<mint>(2*L+1, 0)));
    dp[0][0][L] = 1;
    for(int i=0; i<K; i++){
        for(int j=0; j<=i; j++){
            for(int k=1; k<2*L; k++){
                int PN = j;
                int PM = PN + (L - k);
                if(PM < 0 || i < PM) continue;

                // (PN, PM)
                if(s[PN%L] == t[PM%L]){
                    dp[i+1][PN][k] += dp[i][PN][k]*(mint(1) - p[s[PN%L]-'a']);
                }else{
                    dp[i+1][PN][k] += dp[i][PN][k]*(mint(1) - p[s[PN%L]-'a'] - p[t[PM%L]-'a']);
                }

                // (PN+1, PM)
                if(s[PN%L] != t[PM%L]){
                    dp[i+1][PN+1][k+1] += dp[i][PN][k]*p[s[PN%L]-'a'];
                }

                // (PN, PM+1)
                if(s[PN%L] != t[PM%L]){
                    dp[i+1][PN][k-1] += dp[i][PN][k]*p[t[PM%L]-'a'];
                }

                // (PN+1, PM+1)
                if(s[PN%L] == t[PM%L]){
                    dp[i+1][PN+1][k] += dp[i][PN][k]*p[t[PM%L]-'a'];
                }
            }
        }
    }

    mint X = 0, Y = 0;
    for(int i=1; i<=K; i++){
        for(int j=0; j<=K; j++){
            X += dp[i][j][2*L];
            Y += dp[i][j][0];
        }
    }

    cout << X << ' ' << Y << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}