#include <iostream>#include <iomanip>#include <sstream>#include <cstdio>#include <string>#include <vector>#include <algorithm>#include <complex>#include <cstring>#include <cstdlib>#include <cmath>#include <cassert>#include <climits>#include <queue>#include <set>#include <map>#include <valarray>#include <bitset>#include <stack>using namespace std;#define REP(i,n) for(int i=0;i<(int)n;++i)#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)#define ALL(c) (c).begin(), (c).end()#define chmax(a,b) (a<(b)?(a=b,1):0)#define chmin(a,b) (a>(b)?(a=b,1):0)#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)typedef long long ll;typedef pair<int,int> pii;const int INF = 1<<29;const double PI = acos(-1);const double EPS = 1e-8;ll dp[19][19][2][2][2000];char str[20];int n;ll dfs(int keta, int center, bool less, bool zero, int sum) { if (keta == n) { if (zero) return 0; return sum == 0; } ll &r = dp[keta][center][less][zero][sum]; if (r >= 0) return r; ll res = 0; REP(i,10) { if (!less && i>str[keta]-'0') break; bool nl = less; if (i != str[keta]-'0') nl = 1; int nsum = sum + (center-keta)*i; bool nz = zero; if (i) nz = 0; res += dfs(keta+1, center, nl, nz,nsum); } return r = res;}ll solve(ll a) { if (a == -1) return 0; memset(dp,-1,sizeof(dp)); sprintf(str, "%lld", a); n = strlen(str); ll res = 1; REP(i,n) { res += dfs(0,i,0,1,0); } return res;}int main() { int T; scanf("%d", &T); while(T--) { ll a, b; cin >> a >> b; cout << solve(b) - solve(a-1) << endl; }}
