#ifdef DEBUG
#include "pch.hpp"
#else
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#endif
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using std::cerr, std::cin, std::cout;
#define vec vector
#if __has_include(<atcoder/all>)
using mint = atcoder::modint998244353;
std::istream &operator>>(std::istream &is, mint &a) {
	long long t;
	is >> t;
	a = t;
	return is;
}
std::ostream &operator<<(std::ostream &os, mint a) { return os << a.val(); }
vec<mint> operator*(const vec<mint> &a, const vec<mint> &b) { return a.empty() || b.empty() ? vec<mint>() : atcoder::convolution(a, b); }
vec<mint> &operator*=(vec<mint> &a, const vec<mint> &b) { return a = a * b; }
#endif
typedef long double ld;
#define long long long
#define uint unsigned int
#define ulong unsigned long
#define overload3(a, b, c, name, ...) name
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define rep2(i, n) rep3(i, 0, n)
#define rep1(n) rep2(__i, n)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define per3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define per2(i, n) per3(i, 0, n)
#define per1(n) per2(__i, n)
#define per(...) overload3(__VA_ARGS__, per3, per2, per1)(__VA_ARGS__)
#define all(a) a.begin(), a.end()
#define UNIQUE(a) sort(all(a)), a.erase(unique(all(a)), a.end()), a.shrink_to_fit()
#define sz(a) static_cast<int>(a.size())
#ifndef DEBUG
#define cerr \
	if (0) cerr
// #undef assert
// #define assert(...) void(0)
#undef endl
#define endl '\n'
#endif
template <typename T>
ostream &operator<<(ostream &os, vector<T> a) {
	const int n = a.size();
	rep(i, n) {
		os << a[i];
		if (i + 1 != n) os << " ";
	}
	return os;
}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &a) {
	return is >> a.first >> a.second;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> a) {
	return os << a.first << ' ' << a.second;
};
template <typename T, size_t n>
ostream &operator<<(ostream &os, array<T, n> a) {
	rep(i, n) {
		os << a[i];
		if (i + 1 != n) os << " ";
	}
	return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &a) {
	for (T &i : a) is >> i;
	return is;
}
template <typename T, typename S>
bool chmin(T &x, S y) {
	if ((T)y < x) {
		x = (T)y;
		return true;
	}
	return false;
}
template <typename T, typename S>
bool chmax(T &x, S y) {
	if (x < (T)y) {
		x = (T)y;
		return true;
	}
	return false;
}
template <typename T>
void operator++(vector<T> &a) {
	for (T &i : a) ++i;
}
template <typename T>
void operator--(vector<T> &a) {
	for (T &i : a) --i;
}
template <typename T>
void operator++(vector<T> &a, int) {
	for (T &i : a) i++;
}
template <typename T>
void operator--(vector<T> &a, int) {
	for (T &i : a) i--;
}

template <typename T>
struct M {
	vector<vector<T>> a;
	int n, m;
	M(int n, int m) : n(n), m(m), a(n, vector<T>(m)) {}
	M(int n = 0) : M<T>(n, n) {}
	vector<T> &operator[](int k) { return a[k]; }
	const vector<T> &operator[](int k) const { return a[k]; }
	static M I(int n) {
		M mat(n);
		rep(i, n) mat[i][i] = 1;
		return mat;
	}
	M &operator+=(const M &b) {
		rep(i, n) rep(j, m)(*this)[i][j] += b[i][j];
		return *this;
	}
	M &operator-=(const M &b) {
		rep(i, n) rep(j, m)(*this)[i][j] -= b[i][j];
		return *this;
	}
	M &operator*=(const M &b) {
		int l = b.m;
		vector c(n, vector<T>(l));
		rep(i, n) rep(j, m) rep(k, l) c[i][k] += (*this)[i][j] * b[j][k];
		a.swap(c);
		return *this;
	}
	M &operator^=(long k) {
		M b = M::I(n);
		while (k) {
			if (k & 1) b *= *this;
			*this *= *this;
			k >>= 1;
		}
		a.swap(b.a);
		return *this;
	}
	M operator+(const M &b) const { return (M(*this) += b); }
	M operator-(const M &b) const { return (M(*this) -= b); }
	M operator*(const M &b) const { return (M(*this) *= b); }
	M operator^(const M &b) const { return (M(*this) ^= b); }
};

constexpr int INF = 1e7 + 2025;
bool is_prime[INF];
int bad_prime[INF];
int good_prime[INF];
void solve() {
	int n, m;
	cin >> n >> m;
	if (n == 1) {
		cout << bad_prime[m] << endl;
		return;
	}
	// cout << good_prime[m] << endl;
	M<mint> a(2, 2);
	a[0][0] = 0, a[0][1] = 1, a[1][0] = 2 * good_prime[m], a[1][1] = 1;
	a ^= n - 1;
	mint ans = 0;
	ans += a[0][0] + a[1][0];
	ans += 2 * good_prime[m] * (a[0][1] + a[1][1]);
	cout << ans << endl;
	return;
}
int main() {
	{
		rep(i, 2, INF) is_prime[i] = true;
		rep(i, 2, INF) {
			bad_prime[i] = bad_prime[i - 1];
			good_prime[i] = good_prime[i - 1];
			if (!is_prime[i]) continue;
			bad_prime[i]++;
			for (int j = 2 * i; j < INF; j += i) is_prime[j] = false;
			int ii = i ^ 2;
			if (ii < i && is_prime[ii]) good_prime[i]++;
		}
	}
	// srand((unsigned)time(NULL));
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);
	int t = 1;
	cin >> t;
	while (t--)
		solve();
}