求矩阵的点积的算法问题,分为多行,怎么用C语言的方式实现的

Problem Description
Give you three integers n, A and B.
Then we define Si = Ai mod B and Ti = Min{ Sk | i-A <= k <= i, k >= 1}
Your task is to calculate the product of Ti (1 <= i <= n) mod B.

Input
Each line will contain three integers n(1 <= n <= 107),A and B(1 <= A, B <= 231-1).
Process to end of file.

Output
For each case, output the answer in a single line.

Sample Input
1 2 3
2 3 4
3 4 5
4 5 6
5 6 7

Sample Output
2
3
4
5
6