#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = static_modint<998>;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
/*#include <vector>
template<typename T>
std::vector<vector<T>> matrixMul(const std::vector<std::vector<T>>&A, const std::vector<std::vector<T>>&B) {
	std::vector<vector<T>> C(A.size(), std::vector<T>(B[0].size()));
	for (int i = 0; i < (int)A.size(); ++i) {
		for (int k = 0; k < (int)A[0].size(); ++k) {
			for (int j = 0; j < (int)B[0].size(); ++j) {
				C[i][j] += A[i][k] * B[k][j];
			}
		}
	}
	return C;
}
template<typename T>
std::vector<std::vector<T>> matrixPow(long long n, const std::vector<std::vector<T>> &mat) {
	int size = (int)mat.size();
	vector<vector<mint>> mret(size, vector<mint>(size));
	for (int i = 0; i < size; ++i) {
		mret[i][i] = 1;
	}
	auto cmat = mat;
	while (n > 0) {
		if (1 & n) mret = matrixMul(cmat, mret);
		cmat = matrixMul(cmat, cmat);
		n >>= 1;
	}
	return mret;
}*/
template<class T, T(*add)(T, T), T(*zero)(), T(*mul)(T, T), T(*one)(), int N>
struct Mat : array<array<T, N>, N> {
	using M = Mat<T, add, zero, mul, one, N>;
	void make_identity() {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				(*this)[i][j] = zero();
			}
		}
		for (int i = 0; i < N; i++) {
			(*this)[i][i] = one();
		}
	}
	M& operator+=(const M& rhs) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				(*this)[i][j] = add((*this)[i][j], rhs[i][j]);
			}
		}
		return *this;
	}
	M& operator*=(const M& rhs) {
		static M temp;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				temp[i][j] = zero();
			}
		}
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				for (int k = 0; k < N; k++) {
					temp[i][k] = add(temp[i][k], mul((*this)[i][j], rhs[j][k]));
				}
			}
		}
		*this = temp;
		return *this;
	}
	template <class I>
	void inplace_pow(I k) {
		assert(k >= 0);
		static M temp;
		temp = *this;
		make_identity();
		while (k) {
			if (k & 1) *this *= temp;
			k >>= 1;
			if (k) temp *= temp;
		}
	}
	friend ostream& operator<<(ostream& os, const M& A) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				os << A[i][j] << " \n"[j + 1 == N];
			}
		}
		return os;
	}
};
mint add(mint x, mint y) { return x + y; }
mint zero() { return mint(); }
mint mul(mint x, mint y) { return x * y; }
mint one() { return mint::raw(1); }
using M = Mat<mint, add, zero, mul, one, 2>;
// arrayじゃないと無理？？？
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, m; cin >> n >> m;
		//vector<vector<mint>> a(2);
		//a[0] = { n,0 };
		//a[1] = { 1,1 };
		M a;
		a[0] = { n,1 };
		a[1] = { 0,1 };
		while (m--) {
			string k; cin >> k;
			M dp;
			rep(i, 2)dp[i][i] = 1;
			for (auto c : k) {
				int x = c - '0';
				//dp = matrixPow(10, dp);
				//auto tmp = matrixPow(x, a);
				//dp = matrixMul(dp, tmp);
				dp.inplace_pow(10);
				M tmp = a;
				tmp.inplace_pow(x);
				a *= tmp;
			}
			dp *= a;
			cout << dp[0][1].val() << endl;
			//dp = matrixMul(dp, a);
			//cout << dp[1][0].val() << endl;
		}
	}
	return 0;
}