#include <cstdio>

#include <iostream>

#include <algorithm>

#include <vector>

#include <map>

const int mod = 998244353;

inline void reduce(int &x) { x += x >> 31 & mod; }

int n, m, ans;

std::vector<int> S, T, v[3];

std::map<std::vector<int>, int> f[105];

int dfs(int x, std::vector<int> S, std::vector<int> *v) {

	if (f[x].count(S)) return f[x][S];

	if (!x) return 0;

	int &F = f[x][S];

	for (int i = 0; i < 3; ++i) if (v[i].size())

		for (int j = 0; j < 3; ++j)

			if (!v[j].size() || v[i].back() < v[j].back()) {

				S[v[i].back()] = j;

				v[j].push_back(v[i].back()), v[i].pop_back();

				reduce(F += dfs(x - 1, S, v) - mod);

				S[v[j].back()] = i;

				v[i].push_back(v[j].back()), v[j].pop_back();

			}

	return F;

}

int main() {

	std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0);

	std::cin >> n >> m;

	for (int i = 0, x; i < n; ++i) std::cin >> x, S.push_back(--x);

	for (int i = 0, x; i < n; ++i) std::cin >> x, T.push_back(--x);

	for (int i = n - 1; ~i; --i) v[T[i]].push_back(i);

	f[0][S] = 1;

	for (int i = 0; i <= m; ++i) reduce(ans += dfs(i, T, v) - mod);

	std::cout << ans << '\n';

	return 0;

}