import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author nzeyi
 */
public class C {

    public static void main(String[] arg) throws Exception {
        long a = System.currentTimeMillis();
        String in = "/home/nzeyi/Downloads/C-large.in";
        String out = "/home/nzeyi/Desktop/out";
        BufferedReader r = new BufferedReader(new InputStreamReader(new FileInputStream(in)));
        PrintWriter w = new PrintWriter(new FileOutputStream(out));
        int c = 0;
        int t = Integer.parseInt(r.readLine());
        String s;
        while ((s = r.readLine()) != null) {
            if (!"".equals(s)) {
                c++;
                w.print("Case #" + c + ": " + r(s));
                if (c < t) {
                    w.println();
                }
            }
        }
        r.close();
        w.flush();
        w.close();
        long b = System.currentTimeMillis();
        System.out.println("Done(MS): " + (b - a));
    }

    public static int r(String line) {
        int ret = 0;
        String[] t = line.trim().split("\\s");
        int a = Integer.parseInt(t[0]);
        int b = Integer.parseInt(t[1]);
        for (int i = a; i <= b; i++) {
            ret += p(i, b);
        }
        return ret;
    }

    public static int p(int n, int b) {
        int ret = 0;
        String ns = "" + n;
        int l = ns.length();
        Set<Integer> set = new HashSet<Integer>();
        for (int i = l - 1; i > 0; i--) {
            int r = Integer.parseInt(ns.substring(i) + ns.substring(0, i));
            if ((r > n) && (r <= b) && !set.contains(r)) {
                ret++;
                set.add(r);
            }
        }
        return ret;
    }
}
