Problem B. Harvest of Apples

PS: Not see this can be offline ... Official

The standard does not seem to be regular Mo team's writing, the same block, there is no sort of r, priority to deal with each block answer. We have learned the recursive formula of factorial inverse element.

2 );  for (int111)% MoD;

Avoid addition overflow

 while ( in < LST[I][J].N) val = (0ll + val + val + mod-c (in + +, ik))% mod;

Avoid multiplication overflow

 for 1 1ll if 1 1LL * c * a% mod;

Avoid subtraction and modulo overflow

 while + mod -C (in, ik--))% MoD;

Problem B. Harvest of Apples