#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}


ll brute(ll N,ll X){
	bool Awin[N+1][2][2] = {};
	rep1(i,N) rep(j,2) rep(k,2){
		if(!Awin[i-1][k][1]) Awin[i][j][k] = true;
		if(j==1 && i-X>=0 && !Awin[i-X][k][0]) Awin[i][j][k] = true;
	}
	int res = 0;
	rep1(i,N){
		if(Awin[i][1][1]) res++;
	}
	return res;
}
// X = 6
// 1 3 5 7 9 / 10 12 14 16 18 / 19 21 23 25 27 / 28..
ll solve(ll N,ll X){
	if(X%2 == 1){
		return (N+1)/2;
	}
	N += 4;
	return N/(X+3) * (X/2+2) + (N%(X+3)+1)/2 - 2;
}
int main(){
	// rep1(X,10){
	// 	rep1(N,100){
	// 		ll res = solve(N,X);
	// 		ll god = brute(N,X);
	// 		if(res != god){
	// 			show(X);show(N);show(res);show(god);
	// 			assert(0);
	// 		}
	// 	}
	// }
	int T; cin >> T;
	while(T--){
		ll N,X; cin >> N >> X;
		cout << solve(N,X)%998244353 << '\n';
	}
}