#include <stdio.h>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define ll long long
#define ull unsigned ll

int sub_crunch[1<<16];
int crunch[1<<16];
int append[1<<20][10];

void init() {
    for (int i = 0; i < 16; i++) {
        for (int sub = 0; sub < 1<<i; sub++) {
            sub_crunch[sub|(1<<i)] = sub_crunch[sub] + i;
        }
    }

    for (int sub = 0; sub < 1<<16; sub++) {
        int res = 0;
        for (int i = 0; i < 16; i++) {
            if (sub & (1<<i)) {
                for (int j = 0; j < 16; j++) {
                    if (sub & (1<<j)) {
                        res |= 1<<(i^j);
                    }
                }
            }
        }
        crunch[sub] = sub_crunch[res];
    }

    fprintf(stderr, "done crunch\n");

    for (int sub = 0; sub < 1<<20; sub++) {
        for (int d = 0; d < 10; d++) {
            int suf = (sub&15)^d;
            append[sub][d] = (((sub>>4)|(1<<suf))<<4)|suf;
        }
    }

    fprintf(stderr, "done append\n");
}

ll *data = new ll[1<<20];
ll *ndata = new ll[1<<20];

int get_data(int n) {
    if (n == 0) {
        for (int i = 0; i < 1<<20; i++) data[i] = ndata[i] = 0;
        return 1<<4;
    }

    int x = n%10;
    int lastmask = get_data(n/10);
    for (int mask = 0; mask < 1<<20; mask++) {
        ll ct = data[mask];
        if (ct) {
            for (int d = 0; d < 10; d++) {
                ndata[append[mask][d]] += ct;
            }
        }
        data[mask] = 0;
    }

    for (int d = 0; d < x; d++) {
        ndata[append[lastmask][d]]++;
    }

    swap(data, ndata);
    return append[lastmask][x];
}

ll ans(int n) {
    get_data(n);
    ll ans = 0;
    for (int mask = 0; mask < 1<<20; mask++) {
        ans += crunch[mask>>4] * data[mask];
    }
    return ans;
}

int main() {
    init();
    int z;
    scanf("%d", &z);
    while (z--) {
        int a, b;
        scanf("%d%d\n", &a, &b);
        printf("%lld\n", (ans(b+1) - ans(a)) % 1000000007);
    }
}