L,K=map(int,input().split())
s=list(input())
for i in range(L):
  s[i]=ord(s[i])-ord("a")
t=list(input())
for i in range(L):
  t[i]=ord(t[i])-ord("a")
a=list(map(int,input().split()))
M=998244353
A=sum(a)
iA=pow(A,M-2,M)
X=10**10
w1=0
w2=0
q=[[[0]*(2*L+1) for j in range(L)] for i in range(L)]
nq=[[[0]*(2*L+1) for j in range(L)] for i in range(L)]
q[0][0][0]=1
import gc
for _ in range(K):
  for i in range(L):
    for j in range(L):
      for l in range(-L+1,L):
        if q[i][j][l]==0:
          continue
        if s[i]==t[j]:
          nq[(i+1)%L][(j+1)%L][l]+=q[i][j][l]*a[s[i]]*iA
          nq[(i+1)%L][(j+1)%L][l]%=M
          nq[i][j][l]+=q[i][j][l]*(A-a[s[i]])*iA
          nq[i][j][l]%=M
        else:
          nq[(i+1)%L][j][l+1]+=q[i][j][l]*a[s[i]]*iA
          nq[(i+1)%L][j][l+1]%=M
          if l+1==L:
            w1+=q[i][j][l]*a[s[i]]*iA
            w1%=M
          nq[i][(j+1)%L][l-1]+=q[i][j][l]*a[t[j]]*iA
          nq[i][(j+1)%L][l-1]%=M
          if l-1==-L:
            w2+=q[i][j][l]*a[t[j]]*iA
            w2%=M
          nq[i][j][l]+=q[i][j][l]*(A-a[s[i]]-a[t[j]])*iA
          nq[i][j][l]%=M
  for i in range(L):
    for j in range(L):
      for l in range(-L,L+1):
        q[i][j][l]=nq[i][j][l]
        nq[i][j][l]=0
print(w1,w2)