Bounded Spanning Tree

You are given a connected undirected edge-weighted graph with $n$ vertices and $m$ edges. There are no self-loops in this graph (that is, there is no edge which goes from a vertex to itself), but there can be multiple edges between some pairs of vertices.

Your friend told you the following about this graph:

• The edge weights are distinct integers from the range $[1,m]$. In other words, they form some permutation of integers from $1$ to $m$.
• The weight of the $i^{th}$ edge is from the range $[l_i, r_i]$ for each $i$ from $1$ to $m$.
• The edges with indices $1, 2,\dots, n − 1$ (the first $n − 1$ edges in the input) form a minimum spanning tree of this graph.

As a reminder, a spanning tree of a graph is any subset of its edges that forms a tree (connected graph on $n$ vertices with $n − 1$ edges). The minimum spanning tree of a graph is any spanning tree with the smallest sum of weights among all spanning trees of the graph.

Task

You want to know if it is possible. Determine if there exist such assignments of edge weights for which these conditions hold and if yes, find any of them.

Input data

The first line contains a single integer $t$ — the number of test cases. The description of test cases follows.

The first line of each test case contains two integers $n$ and $m$ — the number of vertices and the number of edges, respectively.
The $i^{th}$ of the following $m$ lines contains four integers $u_i$, $v_i$, $l_i$, $r_i$ — indicating that there is an edge connecting vertices $u_i, v_i$, and that its weight should be in range $[l_i, r_i]$.

Output data

For each test case, if an array of edge weights that satisfy the conditions doesn't exist, output NO in the first line. Otherwise, in the first line, output YES.
In the second line output $m$ integers $w_1, w_2, \dots, w_m$ ($1 \leq w_i \leq m$, all $w_i$ are distinct) — the edge weights (where $w_i$ is the weight assigned to the $i^{th}$ edge in the input).

You can output each letter in any case (for example, YES, Yes, yes, yEs, yEs will be recognized as a positive answer).

Constraints and clarifications

• $1 \leq t \leq 10$
• $1 \leq n − 1 \leq m ≤ 5 \cdot 10^5$
• $1 \leq u_i < v_i \leq n,\ \ 1 \leq l_i \leq r_i \leq m$
• It's guaranteed that for each test case, edges with indices $1, 2,\dots,n − 1$ form a spanning tree of the given graph.
• It's guaranteed the sum of $m$ over all test cases doesn't exceed $5 \cdot 10^5$.
• If there are multiple answers, output any of them.

Example

stdin

3
4 6
1 2 1 3
1 3 2 6
3 4 1 2
1 4 2 5
2 3 2 4
2 4 4 6
4 4
1 2 2 2
2 3 3 3
3 4 4 4
1 4 1 4
5 6
1 2 1 1
2 3 1 2
3 4 2 4
4 5 6 6
1 4 4 6
1 4 5 6

stdout

YES
2 3 1 5 4 6
NO
YES
1 2 3 6 4 5