B"You are asked to build an array a , consisting of n integers, each element should be from 1 to k . The array should be non-decreasing ( a_i <= a_{i+1} for all i from 1 to n-1 ). You are also given additional constraints on it. Each constraint is of one of three following types: Build any non-decreasing array that satisfies all constraints or report that no such array exists. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains three integers n, m and k ( 2 <= n <= 2 cdot 10^4 ; 0 <= m <= 2 cdot 10^4 ; 2 <= k <= 10 ). The i -th of the next m lines contains a description of a constraint. Each constraint is of one of three following types: The sum of n over all testcases doesn't exceed 2 cdot 10^4 . The sum of m over all testcases doesn't exceed 2 cdot 10^4 . For each testcase, determine if there exists a non-decreasing array that satisfies all conditions. If there is no such array, then print -1. Otherwise, print any valid array -- n integers from 1 to k . "...