#include <bits/stdc++.h>
#define f(i,a,b) for(int i = (a); i <= (b); i++)

using namespace std;

const int MOD = 1e9 + 7;
int DP[55][34][34][2][2][2], T;
string A, B;

void dec(string &s)
{
    int pos = s.length() - 1;
    s[pos]--;
    while(s[pos] < '0')
    {
        s[pos] = '9';
        s[--pos]--;
    }
}

void inc(string &s)
{
    int pos = s.length() - 1;
    s[pos]++;
    while(s[pos] > '9')
    {
        s[pos] = '0';
        s[--pos]++;
    }
}

int main()
{
    cin >> T;
    while(T--)
    {
        cin >> A >> B;

        reverse(A.begin(), A.end()), reverse(B.begin(), B.end());
        while(A.length() < 51) A += '0';
        while(B.length() < 51) B += '0';
        reverse(A.begin(), A.end()), reverse(B.begin(), B.end());
        inc(B), dec(A);

        f(i,0,51) f(b,0,32) f(c,0,32) f(sa,0,1) f(sb,0,1) f(u,0,1) DP[i][b][c][sa][sb][u] = 0;
        DP[0][16][16][0][0][0] = 1;

        f(i,0,50) f(b,0,32) f(c,0,32) f(sa,0,1) f(sb,0,1) f(u,0,1)
        {
            if(DP[i][b][c][sa][sb][u] == 0) continue;

            f(nx,'0','9')
            {
                if(nx < A[i] && !sa) continue;
                if(nx > B[i] && !sb) continue;

                int nx_sa = sa | (nx > A[i]);
                int nx_sb = sb | (nx < B[i]);

                int nx_b = b;
                int nx_c = c;
                int nx_u = u | (nx == '3') | (nx == '6') | (nx == '9');

                if(nx == '3') nx_b--, nx_c--;
                if(nx == '6') nx_b++;
                if(nx == '9') nx_c++;

                if(nx_b < 0 || nx_c < 0 || nx_b > 32 || nx_c > 32) continue;

                DP[i+1][nx_b][nx_c][nx_sa][nx_sb][nx_u] += DP[i][b][c][sa][sb][u];
                if(DP[i+1][nx_b][nx_c][nx_sa][nx_sb][nx_u] > MOD) DP[i+1][nx_b][nx_c][nx_sa][nx_sb][nx_u] -= MOD;
            }
        }

        cout << DP[51][16][16][1][1][1] << "\n";
    }
}