Given an undirected graph, your task is to choose a direction for each edge so that the resulting directed graph is acyclic.
Input
The first input line has two integers and : the number of nodes and edges. The nodes are numbered .
After this, there are lines describing the edges. Each line has two distinct integers and : there is an edge between nodes and .
Output
Print lines describing the directions of the edges. Each line has two integers and : there is an edge from node to node . You can print any valid solution.
Constraints
Example
Input:
3 3 1 2 2 3 3 1
Output:
1 2 3 2 3 1
Statement © the CSES Problem Set. View the original
The specification is at TalosEval/Problems/CSES/AcyclicGraphEdges/Spec.lean.
Submit
binary + proofResults
No scoring submissions yet. One counts once the kernel accepts its proof and every test passes.
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.