import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package com.afarok.google.codejam2012.qualificationround;

import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class CRecycledNumber {
    public static void main(String[] ags)  {
        
        //System.setIn(new FileInputStream("src/com/afarok/google/codejam2012/qualificationround/C-small-attempt0.in"));
        //System.setOut(new PrintStream(new File("src/com/afarok/google/codejam2012/qualificationround/C-small-attempt0.out")));
        
        //System.setIn(new FileInputStream("src/com/afarok/google/codejam2012/qualificationround/C-large.in"));
        //System.setOut(new PrintStream(new File("src/com/afarok/google/codejam2012/qualificationround/C-large.out")));


        Scanner stdIn = new Scanner(System.in);
        int t = stdIn.nextInt();
        
        for(int tCase = 1;tCase<=t;++tCase) {
            int a = stdIn.nextInt();
            int b = stdIn.nextInt();
            //boolean[] recycled = new boolean[b+1];
            int y=0;
            for(int i=a;i<=b;++i) {
                Set<Integer> recyledSet = new HashSet<Integer>();
                for(int x=10;;x=x*10) {
                    int r = i%x;
                    if(r==0) continue;
                    int d = i/x;
                    if(d==0) break;
                    int lenghtOfd = (int) Math.floor(Math.log10(d)) + 1;
                    
                    
                    int recycledNum = (int) (r*Math.pow(10, lenghtOfd))+d;
                    if(recycledNum<=i) continue;
                    if(recyledSet.contains(recycledNum)) continue;
                    
                    if(recycledNum>=a&&recycledNum<=b) {
                        ++y;
                        recyledSet.add(recycledNum);
                    }
                }
            }
            System.out.println("Case #"+tCase+": " + y);
        }
    }
}
