#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


constexpr int L = 2010;
constexpr int K = sqrt(L) + 1;

// > K; total len, used len, used sum
Mint f[2][K + 10][L + 10];

// <= K; total len, last value, used sum
Mint g[2][K + 10][L + 10];

Mint ans[L + 10][L + 10];

int main() {
  // append 1
  f[1][1][1] += 1;
  // first <= K
  for (int k = 1; k <= K; ++k) g[1][k][k] += 1;
  for (int n = 1; n <= L; ++n) {
    auto f0 = f[n & 1], f1 = f[(n + 1) & 1];
    auto g0 = g[n & 1], g1 = g[(n + 1) & 1];
    for (int k = 0; k <= K; ++k) for (int m = 0; m <= L; ++m) f1[k][m] = 0;
    for (int k = 0; k <= K; ++k) for (int m = 0; m <= L; ++m) g1[k][m] = 0;
    for (int k = 1; k <= K; ++k) for (int m = 0; m <= L; ++m) {
      // append 1
      f1[k][m] += f0[k][m];
      f1[k + 1][m + 1] += f0[k][m];
      // +1 to all
      if (m + k <= L) f0[k][m + k] += f0[k][m];
      // done (> K)
      if (m + k*K <= L) g0[K][m + k*K] += f0[k][m];
    }
    for (int k = K; k >= 1; --k) for (int m = 0; m <= L; ++m) {
      // append k
      g1[k][m] += g0[k][m];
      if (m + k <= L) g1[k][m + k] += g0[k][m];
      // not k
      g0[k - 1][m] += g0[k][m];
    }
    // done (<= K)
    for (int m = 0; m <= L; ++m) ans[n][m] += g0[0][m];
  }
for(int n=0;n<10;++n)pv(ans[n],ans[n]+10);
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int N, M;
    scanf("%d%d", &N, &M);
    printf("%u\n", ans[N][M].x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}
/*
0 0 0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 1 1 1
0 1 3 4 6 7 9 10 12 13
0 1 5 10 18 26 39 50 67 82
0 1 7 19 41 70 119 174 257 349
0 1 9 31 79 156 295 484 781 1162
0 1 11 46 136 306 637 1156 2023 3267
0 1 13 64 216 547 1245 2472 4662 8112
0 1 15 85 323 911 2255 4859 9823 18306
0 1 17 109 461 1435 3845 8935 19277 38284
*/