// Arup Guha
// 2/3/2026
// Solves a common problem (combinations with repetition) from COT 3100.

import java.util.*;

public class TacoBell {

	public static void main(String[] args) {

		/*** Note: n+r-1 can not exceed 12. Otherwise this code will overflow. ***/
		Scanner stdin = new Scanner(System.in);
		System.out.println("How many total items do you want to buy from Taco Bell?");
		int n = stdin.nextInt();
		System.out.println("How many different items are you willing to eat from their menu?");
		int r = stdin.nextInt();
		
		// Use the combination with repetition formula here.
		System.out.println("You can make "+MathFunctions.combination(n+r-1,r-1)+" unique orders.");
	} 
}