import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

package qualifs;

import gcj.Gcj;

import java.util.HashSet;
import java.util.Set;

public class C {
	
	final private String file;
	
	C (String f) {
		file = f;
	}
	
	public void run() {

		Gcj gcj = new Gcj(file);
		
		gcj.readLine();
		int ncase = gcj.iToken();
		
		for (int cas=1 ; cas <= ncase ; cas++) {
			
			gcj.readLine();
			String A = gcj.sToken();
			String B = gcj.sToken();
			int a = Integer.parseInt(A);
			int b = Integer.parseInt(B);
			int[] aa = gcj.breakdownNumber(A);
			int[] mm = gcj.breakdownNumber(A);
			int[] bb = gcj.breakdownNumber(B);
			
			int n = aa.length;
			int count = b-a;
			int rp = 0;

			Set<String> dejavu = new HashSet<String>();
			
			if (n >= 2) while (count-- > 0) {

				for (int c=1 ; c<n ; c++) {
					boolean rok=false,bok=false;
					
					for (int i=0 ; i<n ; i++) {
						int p = (i+c) % n;

						if ( ! rok) {
							if (mm[p] < mm[i])    break;
							if (mm[p] > mm[i])    rok = true;
						}
						if ( ! bok) {
							if (mm[p] > bb[i])    break;
							if (mm[p] < bb[i] || i == n-1) bok = true;
						}
					}
					
					// dejavu
					if (rok && bok) {
						String u="",v="";
						for (int i=0 ; i<n ; i++) {
							int p = (i+c) % n;
							u+=Integer.toString(mm[i]);
							v+=Integer.toString(mm[p]);
						}
						String s = u+","+v;
						if ( ! dejavu.contains(s)) {
							dejavu.add(s);
							rp++;
						}
					}
				}
				
				// inc
				for (int i=n-1 ; i>=0 ; i--) {
					if (mm[i] == 9) mm[i] = 0;
					else {
						mm[i]++;
						break;
					}
				}
				
			}
			
			Gcj.outcase(cas, false);
			System.out.println(rp);
		}
		
		gcj.terminate();
		
	}
	
}
