#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 998244353;

int p(int n) {
	if (n == 0) return 1;
	int x = p(n / 2);
	if (n % 2 == 0) return (x * x) % MOD;
	else return ((x * x) % MOD * 2) % MOD;
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	int n, k;
	cin >> n >> k;
	int a[n];
	for (int i = 0; i < n; ++i) cin >> a[i];
	vector <int> vec;
	vec.push_back(-1);
	int cnt = 0;
	for (int i = 0; i < n; ++i) {
		if (a[i] > k) vec.push_back(i);
		else ++cnt;
	}
	vec.push_back(n);
	int res = 0;
	for (int i = 1; i < vec.size(); ++i) {
		int x = vec[i] - vec[i - 1] - 1;
		res = (res + (x * (x + 1)) / 2) % MOD;
	}
	int res2 = ((p(cnt) - 1) % MOD + MOD) % MOD;
	cout << res << ' ' << res2;
	return 0;
}