// TLE: Tnm

#include <array>
#include <iostream>
#include <vector>

#include <atcoder/modint>

using mint = atcoder::modint998244353;

mint solve(uint32_t n, uint64_t m) {
    std::vector dp(n + 2, std::vector<mint>(m + 2));
    dp[0][0] = 1;
    for (uint64_t s = 0; s <= n + m; ++s) {
        mint sum = 0;
        for (uint64_t i = std::max<int64_t>(0, s - m); i <= std::min<uint64_t>(n, s); ++i) {
            uint64_t j = s - i;
            sum += dp[i][j];
        }
        for (uint64_t i = std::max<int64_t>(0, s - m); i <= std::min<uint64_t>(n, s); ++i) {
            uint64_t j = s - i;
            dp[i][j] = sum;
            dp[i + 1][j] += dp[i][j];
            dp[i][j + 1] += dp[i][j];
            dp[i + 1][j + 1] += dp[i][j];
        }
    }
    return dp[n][m];
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    uint32_t t;
    std::cin >> t;
    for (uint32_t case_id = 0; case_id < t; ++case_id) {
        uint32_t n;
        uint64_t m;
        std::cin >> n >> m;

        std::cout << solve(n, m).val() << '\n';
    }
}