Numbers and cards

Problem Statement

Numbers and cards Problem Description You are given 10 types of cards. Every card has a specific number written on it from 0 to 9. There are K cards for each number. You have a total of 10*K cards. Select N cards from the provided 10*K cards and determine the number of different sets of N cards that can be generated. The size of these sets must be N. If the order of the cards is different in two sets, then these sets are considered equal. Note: Since the output can be large, print output modulo (10 9 + 7). Complete the solve function. This function takes the following 2 parameters and returns the count of ways: N: Represents the number of cards to be selected K: Represents the count of each type of card Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code. The first line contains two space-separated integers N and K. Output format Print the answer representing the number