|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Even and odd elements at even and odd positions|
|Immediate Smaller Element|
|Remove every k'th node|
|Maximum of all subarrays of size k|
|Boundary Traversal of binary tree|
Given two numbers A and B which define a range, where A < B. Find the count of total numbers in the given range [A … B] divisible by 'M'.
First line of input contains a single integer T which denotes the number of test cases. Then T test cases follows. First line of each test case contains three space separated integers A, B and M.
For each test case, print the count of total numbers in the given range [A … B] divisible by 'M'.
25 100 30
6 15 3