Project Launch

Problem Statement

Project Launch Problem Description Emily is a project manager preparing the launch of a set of marketing campaigns. She has X different campaign ideas, and she can combine them to form a marketing strategy. A strategy is any non-empty selection of her ideas, and because the ideas inside one strategy are not ordered, two selections that use the same ideas are the same strategy. Emily will not put more than Y ideas into a single strategy. Counting the X original one-idea strategies as well, implement numberOfIdeas so that it returns how many strategies Emily can craft. In symbols: C(X, 1) + C(X, 2) + ... + C(X, min(X, Y)) Because that total grows very quickly, return it modulo 10000 . Input Format A single line containing two space-separated integers X and Y , in that order. Output Format A single line containing one integer: the number of possible strategies, taken modulo 10000 . Constraints 1 <= X <= 1200 1 <= Y <= 1200 (The source assessment gives no numeric bounds; the ra