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 de.pat.dev.y2012.qualification.c;

import java.util.*;

/**
 * @author pat.dev@alice.de
 */
public class RecycledNumber {
  private final long lower;
  private final long upper;
  private final long rotationFactor;

  public RecycledNumber(long lower, long upper) {
    this.lower = lower;
    this.upper = upper;
    int numberOfDigits = String.valueOf(lower).length();
    rotationFactor = rotationFactor(numberOfDigits);
  }

  private long rotationFactor(int numberOfDigits) {
    long factor = 1;
    for (int i = 1; i < numberOfDigits; i++) {
      factor *= 10;
    }
    return factor;
  }

  public Set<Pair> pairs() {
    Set<Pair> pairs = new HashSet<Pair>();
    for (long number = lower; number <= upper; number++) {
      Set<Long> rotations = rotations(number);
      for (Long rotation : rotations) {
        pairs.add(new Pair(number, rotation));
      }
    }
    return pairs;
  }

  public Set<Long> rotations(long number) {
    if (rotationFactor == 1) {
      return Collections.emptySet();
    }

    Set<Long> rotations = new HashSet<Long>();
    long rotation = rotate(number);
    while (rotation != number) {
      if (rotation > number && rotation <= upper) {
        rotations.add(rotation);
      }
      rotation = rotate(rotation);
    }
    return rotations;
  }

  private long rotate(long number) {
    long lastDigit = number % 10;
    return number / 10 + lastDigit * this.rotationFactor;
  }

  public static final class Pair {
    public final long m;
    public final long n;

    public Pair(long m, long n) {
      this.m = m;
      this.n = n;
    }

    @Override
    public String toString() {
      return "Pair{" +
        "m=" + m +
        ", n=" + n +
        '}';
    }

    @Override
    public boolean equals(Object o) {
      if (this == o) return true;
      if (!(o instanceof Pair)) return false;

      Pair pair = (Pair) o;

      if (m != pair.m) return false;
      if (n != pair.n) return false;

      return true;
    }

    @Override
    public int hashCode() {
      int result = (int) (m ^ (m >>> 32));
      result = 31 * result + (int) (n ^ (n >>> 32));
      return result;
    }
  }
}
