solve in c++

Taisia has n six-sided dice. Each face of the die is marked with a number from 1 to 6 , each number from 1 to 6 is used once. Taisia rolls all n dice at the same time and gets a sequence of values a1,a2,,an(1ai6), where ai is the value on the upper face of the i-th dice. The sum of this sequence is equal to s. Suddenly, Taisia's pet cat steals exactly one dice with maximum value ai and calculates the sum of the values on the remaining n1 dice, which is equal to r. You only know the number of dice n and the values of s,r. Restore a possible sequence a that fulfills the constraints. Input The first line contains the integer t(1t1000) - the number of testcases. Each testcase is given on a separate line and contains three integers n,s,r(2n50,1r