#include <bits/stdc++.h>

std::pair<int, int> ans[101010];

void solve() {
  long long n;
  std::cin >> n;
  if (n < 101010 && ans[n].first != -1) {
    std::cout << ans[n].first << ' ' << ans[n].second << '\n';
    return;
  }
  long long l = 88'888'888'888'888'889LL, r = l - 1;
  int rem = n % 9;
  if (rem == 0) {
    rem += 9;
  }
  l -= 9 - rem;
  n -= 8 * (9 - rem);
  assert(n % 9 == 0);
  r += n / 9;
  std::cout << l << ' ' << r << '\n';
}

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  for (int i = 0; i < 101010; i++) {
    ans[i] = std::make_pair(-1, -1);
  }
  for (int l = 1; l <= 400; l++) {
    for (int r = l; r <= 400; r++) {
      int sum = 0;
      for (int i = l; i <= r; i++) {
        std::string s = std::to_string(i);
        int val = 0;
        for (auto c : s) {
          val = std::max(val, c - '0');
        }
        sum += val;
      }
      if (sum < 101010) {
        ans[sum] = std::make_pair(l, r);
      }
    }
  }
  int tc;
  std::cin >> tc;
  for (;tc--;) {
    solve();
  }
}