#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
  #define _GLIBCXX_DEBUG
#else
  #define Debug(...) void(0)
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

inline void solve() {
  int n, m;
  cin >> n >> m;
  n %= 2 * m;
  if (m < n) {
    cout << (mint(10).pow(m) - mint(10).pow(n - m)).val() << endl;
  }
  else {
    cout << (mint(10).pow(n) - 1).val() << endl;
  }
}

int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}