#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;

using ll = long long;

const int kMaxN = 33, mod = 1e9 + 7;

ll dgt1[kMaxN], dgt2[kMaxN], dgt3[kMaxN], fl[kMaxN], fr[kMaxN];

void I() {
  memset(fl, 0, sizeof fl);
  memset(fr, 0, sizeof fr);
}

int main() {
  dgt1[0] = 1;
  for (int i = 1; i <= 29; ++ i) {
    dgt1[i] = ((dgt1[i - 1] << 3) + (dgt1[i - 1] << 1)) % mod;
    dgt2[i] = (((dgt2[i - 1] << 3) + (dgt2[i - 1] << 1)) % mod + dgt1[i - 1]) % mod;
  }
  int t;
  for (cin >> t; t; -- t) {
    ll l, r, ans = 0;
    I();
    cin >> l >> r;
    ll idx = 0, f = l - 1, x = 0;
    while (f) {
      dgt3[++ idx] = f % 10;
      f /= 10;
    }
    for (int i = idx; i >= 1; -- i) {
      for (int j = 0; j < 10; ++ j) {
        fl[j] += dgt2[i - 1] * dgt3[i];
        fl[j] %= mod;
      }
      for (int j = 0; j + 1 <= dgt3[i]; ++ j) {
        fl[j] += dgt1[i - 1];
        fl[j] %= mod;
      }
      for (int j = i - 1; j >= 1; -- j) {
        x = (x << 3) + (x << 1);
        x += dgt3[j];
        x %= mod;
      }
      fl[dgt3[i]] += x + 1;
      fl[dgt3[i]] %= mod;
      fl[0] -= dgt1[i - 1];
      fl[0] = (fl[0] + mod) % mod;
    }
    /*--------------------------*/
    idx = 0, f = r, x = 0;
    while (f) {
      dgt3[++ idx] = f % 10;
      f /= 10;
    }
    for (int i = idx; i >= 1; -- i) {
      for (int j = 0; j < 10; ++ j) {
        fr[j] += dgt2[i - 1] * dgt3[i];
        fr[j] %= mod;
      }
      for (int j = 0; j + 1 <= dgt3[i]; ++ j) {
        fr[j] += dgt1[i - 1];
        fr[j] %= mod;
      }
      for (int j = i - 1; j >= 1; -- j) {
        x = (x << 3) + (x << 1);
        x += dgt3[j];
        x %= mod;
      }
      fr[dgt3[i]] += x + 1;
      fr[dgt3[i]] %= mod;
      fr[0] -= dgt1[i - 1];
      fr[0] = (fr[0] + mod) % mod;
    }
    for (int i = 1; i <= 9; ++ i) {
      ans = (ans + i * (fl[i] - fr[i] + mod) % mod) % mod;
    }
    cout << ans % mod << '\n';
  }
  return 0;
}
// by beautiful_chicken233 (uid = 814343) || time: 2023.8.20 || tips:do not copy!