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();
    }
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;

public class ProblemC2 
{
	public boolean checked[];
	public int min, max;
	
	public static void main(String [] args)
	{
		new ProblemC2();
	}
	
	public ProblemC2()
	{
		try
		{
			String inputFile = new String("C-large");
			BufferedReader in = new BufferedReader(new FileReader(inputFile));
			PrintWriter	out = new PrintWriter(new FileWriter(inputFile+".out"),true);
				
			int numCases = Integer.parseInt(in.readLine());
			String [] items = null;
			for(int j = 0 ; j < numCases; j++)
			{
				checked = new boolean[2000001];
				items = in.readLine().split("\\s+");
				min = Integer.parseInt(items[0]);
				max = Integer.parseInt(items[1]);
				int total = 0;
				for(int x = min; x <= max; x++)
				{
					if(! checked[x])
						total+=checkRecycled(x);
				}
				out.println("Case #" + (j+1) + ": " + total);
			}
			in.close();
			out.close();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}

	private int checkRecycled(int x) 
	{
		int matches=1;
		checked[x]=true;
		if(x<10)
			return 0;
		
		int numChecks = 0;
		if(x>=1000000)
			numChecks = 6;
		else if(x>=100000)
			numChecks = 5;
		else if(x>=10000)
			numChecks = 4;
		else if(x>=1000)
			numChecks = 3;
		else if(x>=100)
			numChecks = 2;
		else
			numChecks = 1;
		
		String xstr=new String(""+x);
		int tmp=0;
		for(int i=0; i<numChecks ; i++)
		{
			xstr=xstr.substring(xstr.length()-1)+""+xstr.substring(0,xstr.length()-1);
			if(xstr.startsWith("0"))
				continue;
			tmp = Integer.parseInt(xstr);
			if(x != tmp && tmp >= min && tmp <= max && checked[tmp] == false)
				matches++;
			if(tmp<=2000000)
				checked[tmp]=true;
		}
		if(matches == 1)
			return 0;
		else if(matches == 2)
			return 1;
		else if(matches == 3)
			return 3;
		else if(matches == 4)
			return 6;
		else if(matches == 5)
			return 10;
		else if(matches == 6)
			return 15;
		else if(matches == 7)
			return 21;
		
		return 0;
	}
}
