#C11491. Race Checkpoints Count
Race Checkpoints Count
Race Checkpoints Count
You are organizing a race and need to determine the number of checkpoints visited by each participant. For each test case, you are provided with three integers:
- N: The number of segments or checkpoints in the race.
- M: The number associated with each checkpoint.
- K: An additional parameter that, in this problem, does not affect the outcome.
Your task is to output a sequence of N numbers for each test case, where each number is M. Essentially, for every test case, you must print the number M repeated N times.
Note: Although the input includes a parameter K, it does not influence the output.
inputFormat
The input is read from standard input and has the following format:
T N1 M1 K1 N2 M2 K2 ... NT MT KT
Here, T is the number of test cases. Each of the following T lines contains three space-separated integers: N, M, and K.
outputFormat
For each test case, output a single line containing N space-separated integers. Each integer in the line should be M.
## sample1
6 5 2
5 5 5 5 5 5
</p>