import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package gcj;

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

public class Recycled {
    public static void main(String args[]) throws Exception
    {
        BufferedReader br=new BufferedReader(new FileReader("c:/c.in"));
        BufferedWriter out=new BufferedWriter(new FileWriter("c:/out.txt"));
        String s;
      
        int t=Integer.parseInt(br.readLine());
        for(int i=0;i<t;i++)
        {s=br.readLine();
        String s2[]=s.split(" ");
        int a=Integer.parseInt(s2[0]);
        int b=Integer.parseInt(s2[1]);
        int res=0;
        
        for(int j=a;j<=b;j++)
        { int arr[]=new int[10];
          int dupidx=0;
          if(j<=10)
              continue;
          s=Integer.toString(j);
          int l=s.length();
          while(l>0)
          {
              s=s.substring(s.length()-1)+s.substring(0,s.length()-1);
              if(s.charAt(0)=='0')
              {   l--;
                  continue;
              }
              else
              {
                  if(Integer.parseInt(s)==j)
                  { l--;
                  continue;
                  }
                  if(check(arr,dupidx,Integer.parseInt(s))&Integer.parseInt(s)>j&&Integer.parseInt(s)<=b&&Integer.parseInt(s)>=a)
                  {   
                      arr[dupidx]=Integer.parseInt(s);
                      dupidx++;
                      res++;
                  
                  }
              }
              l--;
          }
        }
        out.write("Case #"+(i+1)+": "+res+"\n");
        }
        out.close();
    }
    public static boolean check(int arr[],int maxid,int val)
    {
        for(int i=0;i<maxid;i++)
        {
            if(arr[i]==val)
                return false;
        }
        return true;
    }
}
