/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
package qual;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

public class Recycled {
	public static void main(String[] args) throws IOException {
		new Recycled().run();
	}
	class Pair {
		int a, b;
		Pair(int a, int b) {
			this.a = a;
			this.b = b;
		}
		public boolean equals(Object other) {
			Pair p = (Pair) other;
			return this.a == p.a && this.b == p.b;
		}
		public int hashCode() {
			return this.a * 2000003 + this.b;
		}
		
	}
	public HashSet<Pair> set = new HashSet<Pair>();
	
	void add(Pair p, int left, int right) {
		if (p.a < p.b && left <= p.a && p.a <= right && left <= p.b && p.b <= right) {
			set.add(p);
		}
	}
	
	int powers[] = {10, 100, 1000, 10000, 100000, 1000000, 10000000};
	
	void fill(int left, int right, int curpow) {
		for (int i = left; i <= right; i++) {
			int val = i;
			for (int p : powers) {
				if (val >= p) {
					int lp = val / p;
					int rp = val % p;
					int newval = rp * (curpow / p) + lp;
					add(new Pair(val, newval), left, right);
				}
			}
		}
	}
	
	public void run() throws IOException {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		fill(1,       9,       10);
		fill(10,      99,      100);
		fill(100,     999,     1000);
		fill(1000,    9999,    10000);
		fill(10000,   99999,   100000);
		fill(100000,  999999,  100000);
		fill(1000000, 2000000, 10000000);
		
		int tests = in.nextInt();
		for (int test = 0; test < tests; test++) {
			int a = in.nextInt(), b = in.nextInt();
			int count = 0;
			for (Pair p: set) {
				if (a <= p.a && p.a <= b && a <= p.b && p.b <= b) {
					count++;
				}
			}
			out.printf("Case #%d: %d\n", test + 1, count); 
		}
		out.close();
	}
}
