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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.util.*;
import java.io.*;

public class Qual2012 {

	public static void lame() {
		try {
			FileReader fr = new FileReader("input.txt");
			BufferedReader reader = new BufferedReader(fr);
			PrintWriter writer = new PrintWriter("output.txt");

			HashMap<String, String> dictionary = new HashMap<String, String>();
			dictionary.put("a", "y");
			dictionary.put("b", "h");
			dictionary.put("c", "e");
			dictionary.put("d", "s");
			dictionary.put("e", "o");
			dictionary.put("f", "c");
			dictionary.put("g", "v");
			dictionary.put("h", "x");
			dictionary.put("i", "d");
			dictionary.put("j", "u");
			dictionary.put("k", "i");
			dictionary.put("l", "g");
			dictionary.put("m", "l");
			dictionary.put("n", "b");
			dictionary.put("o", "k");
			dictionary.put("p", "r");
			dictionary.put("q", "z");
			dictionary.put("r", "t");
			dictionary.put("s", "n");
			dictionary.put("t", "w");
			dictionary.put("u", "j");
			dictionary.put("v", "p");
			dictionary.put("w", "f");
			dictionary.put("x", "m");
			dictionary.put("y", "a");
			dictionary.put("z", "q");
			dictionary.put(" ", " ");
			int numCases = Integer.parseInt(reader.readLine());

			for (int i = 1; i <= numCases; i++) {
				String sentence = reader.readLine();
				String newSentence = "";
				for (char c : sentence.toCharArray()) {
					char[] temp = new char[1];
					temp[0] = c;
					newSentence += dictionary.get(new String(temp));
				}
				writer.println("Case #" + i + ": " + newSentence);
			}

			writer.close();
			fr.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static boolean canMatch(int score, int target) {
		if (score == 0)
			return target <= 0;
		if (score == 1 || score == 2)
			return target <= 1;
		if (score % 3 == 0) {
			return score / 3 >= target;
		}
		return ((score / 3) + 1 >= target);
	}

	public static boolean canMatchSpecial(int score, int target) {
		if (score == 0)
			return target <= 0;
		if (score == 1)
			return target <= 1;
		if (score == 2)
			return target <= 2;
		if (score % 3 == 1)
			return (score / 3 + 1) >= target;
		return (score / 3 + 2) >= target;
	}

	public static void dance() {
		try {
			FileReader fr = new FileReader("input.txt");
			BufferedReader reader = new BufferedReader(fr);
			PrintWriter writer = new PrintWriter("output.txt");

			int numCases = Integer.parseInt(reader.readLine());
			for (int i = 1; i <= numCases; i++) {
				StringTokenizer line = new StringTokenizer(reader.readLine(),
						" ");
				int numDancers = Integer.parseInt(line.nextToken());
				int numSurprising = Integer.parseInt(line.nextToken());
				int bestScore = Integer.parseInt(line.nextToken());
				List<Integer> scores = new LinkedList<Integer>();
				for (int j = 0; j < numDancers; j++)
					scores.add(Integer.parseInt(line.nextToken()));
				int count = 0;
				for (Integer score : scores) {
					if (canMatch(score, bestScore))
						count++;
					else if (canMatchSpecial(score, bestScore)
							&& numSurprising > 0) {
						numSurprising--;
						count++;
					}
				}
				writer.println("Case #" + i + ": " + count);
			}

			writer.close();
			fr.close();

		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static void recycle() {
		try {
			FileReader fr = new FileReader("input.txt");
			BufferedReader reader = new BufferedReader(fr);
			PrintWriter writer = new PrintWriter("output.txt");
			
			int numCases = Integer.parseInt(reader.readLine());
			for (int i = 1; i <= numCases; i++) {
				StringTokenizer line = new StringTokenizer (reader.readLine(), " ");
				int A = Integer.parseInt(line.nextToken());
				int B = Integer.parseInt(line.nextToken());
				int count = 0;
				for (int k = A; k <= B; k++) {
					if (k < 10) {
						continue;
					}
					String temp = "" + k;
					String cmp = "" + k;
					int length = temp.length();
					temp = temp.substring(length-1) + temp.substring(0, length - 1);
					while (!temp.equals(cmp)) {
						int cycle = Integer.parseInt(temp);
						if (A <= cycle && cycle <= B)
							count++;
						temp = temp.substring(length-1) + temp.substring(0, length - 1);
					}
				}
				writer.println ("Case #" + i + ": " + count/2);
			
				
			}
			
			writer.close();
			fr.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static void main(String[] args) {
		// lame();
		// dance();
		recycle();
		
	}
}