#include <bits/stdc++.h>
using namespace std;

inline int read()
{
	int x = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9')
	{
		if (c == '-') f = -1;
		c = getchar();
	}
	while (c >= '0' && c <= '9')
	{
		x = x * 10 + c - 48;
		c = getchar();
	}
	return x*f;
}
inline void write(int x)
{
	if (x < 0)
	{
		x = -x;
		putchar('-');
	}
	if (x >= 10) write(x / 10);
	putchar((x % 10) + 48);
}

const int MOD = 998244353;

const int N = 5e3 + 10;

int c, T;
int n, m;

int ans;
int s[N];

unordered_map<string, bool> lis;

void dfs(int l, int r)
{
	if (l > r) return;

	string w;
	for (int i = l; i <= r; i++) w += to_string(s[i]) + ",";
	lis[w] = true;


	//for (int i = l; i <= r; i++) cerr << s[i] << " ";
	//cerr << endl;

	//cerr << w << endl;

	int sumax = 0;
	for (int i = l; i <= r; i++)
	{
		if (s[i] > sumax)
		{
			if (s[i] == 1) dfs(i + 1, r);
			else
			{
				s[r + 1] = s[i] - 1;
				dfs(i + 1, r + 1);
			}
		}
		sumax = max(sumax, s[i]);
	}
}
signed main()
{
	freopen("seal.in", "r", stdin);
	freopen("seal.out", "w", stdout);

	c = read(), T = read();
	for (int foi = 1; foi <= T; foi++)
	{
		lis.clear();

		n = read(), m = read();
		for (int i = 1; i <= n; i++) s[i] = read();

		dfs(1, n);

		ans = static_cast<int>(lis.size()) % MOD;
		write(ans);
		putchar('\n');
	}

	return 0;
}