import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.set_int_max_str_digits(10 ** 6)
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    L, K = NMI()
    S = [ord(s)-ord("a") for s in SI()]
    T = [ord(s)-ord("a") for s in SI()]
    A = NLI()
    total = sum(A)
    inv_total = pow(total, MOD99-2, MOD99)
    # k回やってPNがi, PMがi+jのときの確率
    dp = [[[0]*(2*L+1) for _ in range(L)] for _ in range(K+1)]
    dp[0][0][0] = 1
    X = 0
    Y = 0
    for k in range(K):
        for i in range(L):
            for j in range(-L+1, L):
                s = S[i]
                t = T[(i+j)%L]
                d = dp[k][i][j]
                for c in range(26):
                    ni = i + int(s==c)
                    nj = i+j + int(t==c) - ni
                    p = A[c] * inv_total % MOD99
                    if nj == -L:
                        X += d * p % MOD99
                    elif nj == L:
                        Y += d * p % MOD99
                    else:
                        # print(k, ni, nj)
                        dp[k+1][ni%L][nj] += d * p % MOD99
    print(X % MOD99, Y % MOD99)


if __name__ == "__main__":
    main()