// Arup Guha
// 9/17/2015
// Solution to 2002 UCF HS Contest Problem: Hawaiian Fire Drill!

import java.util.*;

public class seating {

	public static void main(String[] args) {

		// Fill in factorial look up chart.
		int[] fact = new int[13];
		fact[0] = 1;
		for (int i=1; i<fact.length; i++)
			fact[i] = fact[i-1]*i;

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();

		// Process cases.
		for (int loop=1; loop<=numCases; loop++) {

			int n = stdin.nextInt();
			int drivers = stdin.nextInt();

			// Luckily, we don't have to do derangements. This is basic counting.
			int res = fact[n-1]*drivers;

			// Ta da!
			System.out.println("Data set #"+loop+": "+res+" combination(s) possible.");
		}
	}
}