Problem: Requirements

* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \leq i \leq |E|)
* The given graph has no self-loops / multiple edges and is guaranteed to be connected.
* 0 \leq N_{\text{new}} \leq 1
* 1 \leq \mathrm{new\\_id}_{i} \leq T_{\text{last}}+1 (1 \leq i \leq N_{\text{new}}). Note: If all orders are generated by the order generation rule as explained above, the total number of orders is at most T_{\text{last}}+1. Therefore, the possible range of \mathrm{new\\_id}_{i} should be from 1 to T_{\text{last}}+1.
* 2 \leq \mathrm{dst}_i \leq |V| (1 \leq i \leq N_{\text{new}})
* The order IDs \mathrm{new\\_{id}}_i are unique.

Input Format

Input is provided in the following form:


|V| |E|
u_{1} v_{1} d_{u_{1}, v_{1}}
u_{2} v_{2} d_{u_{2}, v_{2}}
:
u_{|E|} v_{|E|} d_{u_{|E|}, v_{|E|}}
T_{\text{max}}
\mathrm{info}_{0}
\mathrm{info}_{1}
:
\mathrm{info}_{T_{\text{max}}-1}


* In the first line |V| denotes the number of vertices, while |E| denotes the number of edges.
* The following |E| lines denote the edges of the graph. In particular, in the ith line u_{i} and v_{i} denote the edge connecting u_{i} and v_{i} and d_{u_{i}, v_{i}} the corresponding distance.
* The following line denotes the number of steps T_{\text{max}}.



In the following line, \mathrm{info}_t is information about the order from the customer that occurs at time t. \mathrm{info}_t is given in the form:


N_{\text{new}}
\mathrm{new\_id}_1 \mathrm{dst}_1
\mathrm{new\_id}_2 \mathrm{dst}_2
\vdots
\mathrm{new\_id}_{N_{\text{new}}} \mathrm{dst}_{N_{\text{new}}}


* N_{\text{new}} represents the number of new orders which appear at time t.
* The next N_{\text{new}} lines give the newly generated order information. The i-th order information indicates that the order ID \mathrm{new\\_{id}}_i of the new order, while \mathrm{dst}_i denotes the vertex to which the customer wishes the order to be delivered.
* Note: If N_{\text{new}}=0, there are no new lines.

Output Format

The Output expects T_{\text{max}} integers in the format specified below.


\mathrm{command}_{0}
\mathrm{command}_{1}
:
\mathrm{command}_{T_{\text{max}}-1}


In particular, \mathrm{command}_{i} shall specify the movement of the delivery car by using one of the following two options:

1) `stay`, if the car shall not move:


-1


2) `move w`, if the car shall be moved one step towards the neighboring vertex w


w


Note that in case of 2) w has to satisfy the following conditions:

* w \in V
* If the car is at vertex u: \left\\{ u, w \right\\} \in E .
* If the car is on the edge \left\\{ u, v \right\\}, w must either satisfy u = w or v = w.



* * *

Examples

Input




Output




Input

5 7
1 2 5
5 3 4
2 4 8
1 5 1
2 3 3
4 5 3
4 3 9
4
1
1 2
1
2 5
1
3 4
0


Output

2
-1
1
5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

struct Graph {
	struct Edge {
		int from;
		int to;
		int dist;
	};

	struct State {
		State() : ts(0), node(1), edgeId(-1), delta(0) {}

		void stay() {
			cout << -1 << endl;
		}

		void move(int target) {
			// TODO: implement
		}

		void movePhysical(int target) {
		}

		// current timestamp
		int ts;

		// which node the car is currently on, if not on any edge
		int node;
		// detect which edge the car is on; -1 means it's staying at the source node	
		int edgeId;
		// the distance from the source, only apply when edgeId >= 0
		int delta;
	};

	void addEdge(int from, int to, int dist) {
		edges.push_back({from, to, dist});
	}

	int N;
	vector< Edge > edges;
	State state;
};

// For problem A, the orders are known in advance
struct OrderOffline {
	OrderOffline() {}

	OrderOffline(int Tmax_) : Tmax(Tmax_) {
		orders.resize(Tmax_ + 1);
	}

	struct Order {
		int orderId;
		int to;
	};

	void addOrder(int ts, int orderId, int to) {
		orders[ts].push_back({orderId, to});
	}

	int Tmax;
	vector< vector<Order> > orders;
};

Graph graph;
OrderOffline customer;

void readInput() {
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++) {
		int from, to, dist;
		scanf("%d %d %d", &from, &to, &dist);
		graph.addEdge(from, to, dist);
	}

	int Tmax;
	scanf("%d", &Tmax);
	customer = OrderOffline(Tmax);
	for (int i = 1; i <= Tmax; i++) {
		int norders;
		scanf("%d", &norders);
		for (int j = 0; j < norders; j++) {
			int orderId, to;
			scanf("%d %d", &orderId, &to);
			customer.addOrder(i, orderId, to);
		}
	}
}

void naive() {
	for (int i = 1; i <= customer.Tmax; i++) {
		graph.state.stay();
	}
}

int main() {
	readInput();
	naive();
	return 0;
}