import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

package com.menzus.gcj._2012.qualification.c;

import java.util.HashSet;
import java.util.Set;

import com.menzus.gcj.common.OutputProducer;

public class COutputProducer implements OutputProducer<CInput, COutputEntry> {

    @Override
    public COutputEntry produceOutput(CInput input) {
	int lowerLimit = input.getLowerLimit();
	int upperLimit = input.getUpperLimit();
	long recycledPairNumber = 0;
	Set<Integer> pairs = new HashSet<Integer>();
	for (int i = lowerLimit; i < upperLimit; i++) {
	    pairs.clear();
	    int numberLength = getNumberLength(i);
	    int numberMajor = getMajorNumber(i);
	    int rotatedNumber = i;
	    for (int j = 0; j < numberLength - 1; j++) {
		rotatedNumber = rotateNumber(rotatedNumber, numberMajor);
		if (numberLength == getNumberLength(rotatedNumber)) {
		    if (rotatedNumber >= lowerLimit && rotatedNumber <= upperLimit && rotatedNumber > i) {
			if (!pairs.contains(rotatedNumber)) {
			    recycledPairNumber++;
			    pairs.add(rotatedNumber);
			}
		    }
		}
	    }
	}
	COutputEntry outputEntry = new COutputEntry();
	outputEntry.setRecycledPairNumber(recycledPairNumber);
	return outputEntry;
    }

    //
    // private int rotateNumber(int i, int majorNumber) {
    // return (i / 10) + ((i % 10) * majorNumber);
    // }

    private int rotateNumber(int i, int majorNumber) {
	return ((i % majorNumber) * 10) + (i / majorNumber);
    }

    private int getMajorNumber(int i) {
	if (i < 10) {
	    return 1;
	} else if (i < 100) {
	    return 10;
	} else if (i < 1000) {
	    return 100;
	} else if (i < 10000) {
	    return 1000;
	} else if (i < 100000) {
	    return 10000;
	} else if (i < 1000000) {
	    return 100000;
	} else {
	    return 1000000;
	}
    }

    private int getNumberLength(int i) {
	if (i < 10) {
	    return 1;
	} else if (i < 100) {
	    return 2;
	} else if (i < 1000) {
	    return 3;
	} else if (i < 10000) {
	    return 4;
	} else if (i < 100000) {
	    return 5;
	} else if (i < 1000000) {
	    return 6;
	} else {
	    return 7;
	}
    }
}
