SP6042 QCJ2 - Another Box Problem

There are N numbered boxes placed on a table, let Bi denote the ith box in the line. Write a program that finds the total number of ways to place N identical balls such that atmost k balls are present in the boxes B1, .... ,Bk for 1

Input will contain multiple testcases, on each line N (1

For each testcase output exactly one line, the total number possible of ways modulo 761238923.