#include<string>

#include<iostream>

#include<algorithm>

#include<cstdio>

#include<queue>

#include<map>

#include<vector>

#define rep(i,l,r) for (int i=l;i<=r;i++)

#define down(i,l,r) for (int i=l;i>=r;i--)

#define clr(x,y) memset(x,y,sizeof(x))

#define ll long long

#define maxn 109

#define mm 998244353

using namespace std;

vector<int> v;

int n,m,S[maxn],T[maxn],ans;

map<vector<int>,int> F[maxn];

int read(){

    int x=,f=; char ch=getchar();

    while (!isdigit(ch)){if (ch=='-') f=-; ch=getchar();}

    while (isdigit(ch)){x=x*+ch-''; ch=getchar();}

    return x*f;

}

void up(int &x){

    if (x>mm) x-=mm;

}

int main(){

    n=read(); m=read();

    rep(i,,n) S[i]=read();

    rep(i,,n) T[i]=read();

    v.clear(); rep(i,,n) v.push_back(S[i]);

    F[][v]=;

    rep(i,,m-){

        for (map<vector<int>,int>::iterator it=F[i].begin();it!=F[i].end();it++){

            v=it->first;

            int s[]={n+,n+,n+,n+};

            down(k,n,) s[v[k-]]=k;

            rep(A,,) if (s[A]!=n+){

                rep(B,,) if (s[A]<s[B]){

                    v[s[A]-]=B; up(F[i+][v]+=it->second); v[s[A]-]=A;

                }

            }

        }

    }

    v.clear(); rep(i,,n) v.push_back(T[i]);

    ans=;

    rep(i,,m) up(ans+=F[i][v]);

    printf("%d\n",ans);

    return ;

}