1. MAGIC SEQUENCE

The sequence is defined as follows The first five numbers of the sequence are the first five natural numbers respectively.(1,2,3,4,5). , From then the nth term is the sum of its n%5+1 preceding terms . For example term39 is the sum of 39%5+1=5 preceding five terms (t38+t37+t36+t35+t34) .

INPUT FORMAT

The input will be an integer in the first line denoting the number(t) of test cases (at most five). From the next line there follow t lines containing three numbers separated by spaces out of which the first two denote the indices of terms .You need to add all the terms starting from the first index to the last one in the above sequence and find out its mod with the third number . First two numbers lie between 1 & 30000000. The third number will be having at most 30 digits in it .

OUTPUT FORMAT

All you need to print is only the remainder for each test case in a new line.No new line at the end.

SAMPLE INPUT

4
1 5 15
1 23 34
1 345 3948394875023947
12345 123456 10293847568765432109123857640
SAMPLE OUTPUT

0
6
244925775962101974
3248055569802838550909454360