from collections import deque, defaultdict as dd
from copy import deepcopy
from heapq import heappop, heappush, heappushpop, heapify
INF = 1 << 60
MOD = 998244353


def fast_mod_pow(x, p, m):
    res = 1
    t = x
    z = p
    while z > 0:
        if z % 2 == 1:
            res = (res * t) % m
        t = (t * t) % m
        z //= 2
    return res


def extended_gcd(a, b):
    if b == 0:
        return a, 1, 0
    else:
        g, x, y = extended_gcd(b, a % b)
        return g, y, x - (a // b) * y


def mod_inverse(a, m):
    _, x, _ = extended_gcd(a, m)
    return (x % m + m) % m


def main():
    l, k = map(int, input().split())
    s = list(input())
    t = list(input())
    a = list(map(int, input().split()))
    ac = sum(a)
    div = mod_inverse(ac, MOD)
    for i in range(26):
        a[i] = (a[i]*div)%MOD
    z = ord("a")
    for i in range(l):
        s[i] = ord(s[i])-z
        t[i] = ord(t[i])-z
    dp = [[0 for _ in range(2*l+1)]for _ in range(l)]
    dp[0][l] = 1
    for _ in range(k):
        ndp = [[0 for _ in range(2 * l + 1)] for _ in range(l)]
        for i in range(l):
            ndp[i][0] = dp[i][0]
            ndp[i][-1] = dp[i][-1]
            for j in range(1, 2*l):
                idx1, idx2 = s[i], t[(i+j-l)%l]
                if idx1==idx2:
                    ndp[i][j] = (ndp[i][j]+dp[i][j]*(MOD+1-a[idx1]))%MOD
                    ndp[(i+1)%l][j] = (ndp[(i+1)%l][j]+dp[i][j]*a[idx1])%MOD
                else:
                    ndp[i][j] = (ndp[i][j]+dp[i][j]*(2*MOD+1-a[idx1]-a[idx2])%MOD)%MOD
                    ndp[(i+1)%l][j+1] = (ndp[(i+1)%l][j+1]+dp[i][j]*a[idx1])%MOD
                    ndp[i][j-1] = (ndp[i][j-1]+dp[i][j]*a[idx2])%MOD
        dp = ndp
    ans1, ans2 = 0, 0
    for i in range(l):
        ans1 = (ans1+dp[i][2*l])%MOD
        ans2 = (ans2+dp[i][0])%MOD
    print(ans1, ans2)


if __name__ == "__main__":
    main()