#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int t; cin >> t;
  while (t--) {
    ll n, x; cin >> n >> x;
    cout << (x % 2 == 1 || x > n ? (n + 1) / 2 : n / (x + 3) * (x / 2 + 2) + (x < n ? (x + 1) / 2 : (x + 2) / 2)) % MOD << '\n';
  }
  return 0;

  // FOR(x, 1, X) {
  //   int dp[N][2][2]{};
  //   REP(i, N) REP(j, 2) fill(dp[i][j], dp[i][j] + 2, -1);
  //   const auto f = [&](auto&& f, const int num, const bool alice, const bool bob) -> bool {
  //     if (dp[num][alice][bob] != -1) return dp[num][alice][bob];
  //     if (num == 0) return dp[num][alice][bob] = false;
  //     return dp[num][alice][bob] = !f(f, num - 1, bob, true) || (num >= x && alice && !f(f, num - x, bob, false));
  //   };
  //   cout << x << ": ";
  //   FOR(i, 1, N) cout << (f(f, i, true, true) ? 'o' : 'x');
  //   cout << '\n';
  // }
}