import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}

import java.util.*;
import java.io.*;
import java.lang.*;

class RecycledNumbers { 
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int T = Integer.parseInt(sc.nextLine());
    boolean[] taken = new boolean[2000001];
    
    for (int i=0; i<T; i++) {
    	int count = 0;
    	String[] dat = sc.nextLine().split(" ");
    	Arrays.fill(taken, false);
    	int digits = dat[0].length();
    	int A = Integer.parseInt(dat[0]);
    	int B = Integer.parseInt(dat[1]);
    	for (int j=A; j<=B; j++) {
    		if (!taken[j]) {
    			//System.out.println(j);
    			taken[j] = true;
    			int c = 1;
    			for (int k=1; k<digits; k++) {
    				int rem = j % (int)Math.pow(10, k);
    				int res = rem * (int)Math.pow(10, digits-k) + j / (int)Math.pow(10, k);
    				if (A <= res && res <= B && j != res && !taken[res]) { taken[res] = true; c++; }
    			}
    			if (c > 1) {
    				//System.out.println(j+" "+c);
						int r = 0;
						for (int k=c-1; k>=1; k--) r += k;
						count += r;
					}
    		}
    	}
    	
    	/*int cc= 0;
    	for (int a=A; a<=B; a++) {
    		for (int b=a+1; b<=B; b++) {
    			boolean found = false;
    			for (int k=1; k<digits; k++) {
    				int rem = a % (int)Math.pow(10, k);
    				int res = rem * (int)Math.pow(10, digits-k) + a / (int)Math.pow(10, k);
    				if (res == b) { found = true; break; }
    			}
    			if (found) { cc++; }
    		}
    	}
    	System.out.println(cc);*/
    	System.out.println("Case #" + (i+1) + ": " + count);
    }
  }
}

