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(k+2)]for _ in range(k+2)]
    dp[0][0] = 1
    for _ in range(k):
        for i in range(k, -1, -1):
            for j in range(k, -1, -1):
                if abs(i-j) >= l: continue
                if s[i%l]==t[j%l]:
                    dp[i+1][j+1] = (dp[i+1][j+1]+dp[i][j]*a[s[i%l]])%MOD
                    dp[i][j] = (dp[i][j]*(MOD+1-a[s[i%l]])%MOD)%MOD
                else:
                    dp[i+1][j] = (dp[i+1][j]+dp[i][j]*a[s[i%l]])%MOD
                    dp[i][j+1] = (dp[i][j+1]+dp[i][j]*a[t[j%l]])%MOD
                    dp[i][j] = (dp[i][j]*(2*MOD+1-a[s[i%l]]-a[t[j%l]]))%MOD
    ans1, ans2 = 0, 0
    for i in range(k+2):
        for j in range(k+2):
            if i+l <= j:
                ans2 = (ans2+dp[i][j])%MOD
            elif i >= l+j:
                ans1 = (ans1+dp[i][j])%MOD
    print(ans1, ans2)


if __name__ == "__main__":
    main()