import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.util.Scanner;
import java.io.*;

public class Google2 {
  public static void main(String[] args) throws IOException {
    Scanner kb = new Scanner(new File("c:/A-small-attempt0.in"));
//    Scanner kb = new Scanner(System.in);
    int num = kb.nextInt();
    for (int i = 0; i < num; i++) {
      int a = kb.nextInt();
      int b = kb.nextInt();
      int count = 0;
      for (int j = a; j < b; j++) {
        for (int k = j + 1; k <= b; k++) {
          //System.out.println("++++ "+j + " " + k + " ");
          if (isRecycled(j, k)) {
            count++;
            //System.out.print(count);
          }
          //System.out.println();
        }
      }
      System.out.println("Case #" + (i + 1) + ": " + count);
    }
  }
  public static boolean isRecycled(int a, int b) {
    String n = a + "";
    String m = b + "";
    int numLength = n.length();
    for (int i = 1; i < numLength; i++) {
      if (n.substring(0, i).equals(m.substring(numLength - i, numLength)) && n.substring(i, numLength).equals(m.substring(0, numLength - i))) {
        //System.out.println(" true");
        return true;
      }
    }
    return false;
  }
}

