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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Set;

public class Main {
	static PrintWriter pw = new PrintWriter(System.out);
	static int v, e, tmax, tlast;
	static int[][] dist;
	static List<Integer>[][] route;
	static List<List<Hen>> nextList;
	static List<List<Order>> infoList;
	static int t = 0;
	static long tmax2 = 0;
	static long K;

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		v = Integer.parseInt(sa[0]);
		e = Integer.parseInt(sa[1]);
		dist = new int[v][v];
		route = new List[v][v];
		nextList = new ArrayList<>(v);
		for (int i = 0; i < v; i++) {
			nextList.add(new ArrayList<>());
		}
		for (int i = 0; i < e; i++) {
			sa = br.readLine().split(" ");
			int a = Integer.parseInt(sa[0]) - 1;
			int b = Integer.parseInt(sa[1]) - 1;
			int c = Integer.parseInt(sa[2]);
			nextList.get(a).add(new Hen(b, c));
			nextList.get(b).add(new Hen(a, c));
		}

		tmax = Integer.parseInt(br.readLine());
		tlast = (int) (tmax * 0.95);
		tmax2 = tmax * tmax;
		K = 14_0000_0000_0000L / 30 / tmax; // 時間1当たりの価値（14兆÷30ケース÷Tmax）
		infoList = new ArrayList<>(tmax);
		for (int i = 0; i < tmax; i++) {
			int n = Integer.parseInt(br.readLine());
			List<Order> orderList = new ArrayList<>(n);
			for (int j = 0; j < n; j++) {
				sa = br.readLine().split(" ");
				Order o = new Order();
				o.id = Integer.parseInt(sa[0]);
				o.dst = Integer.parseInt(sa[1]) - 1;
				o.time = i;
				orderList.add(o);
			}
			infoList.add(orderList);
		}
		br.close();

		for (int i = 0; i < v; i++) {
			dijkstra(i);
		}

		int gotT = 0;
		int now = 0;
		int next = 0;
		boolean judged = false;
		Map<Integer, List<Order>> carMap = new HashMap<>();
		label:
		while (t < tmax) {
			if (now == 0) {
				// 前回～時刻tの商品を積み込み
				for ( ; gotT <= t; gotT++) {
					for (Order o : infoList.get(gotT)) {
						List<Order> list = carMap.get(o.dst);
						if (list == null) {
							list = new ArrayList<>();
							carMap.put(o.dst, list);
						}
						list.add(o);
					}
				}
				// 荷物なしの場合は店で待機
				if (carMap.isEmpty()) {
					pw.println(-1);
					t++;
					continue label;
				}

				// 出発を待つか判定
				if (!judged) {
					Map<Integer, List<Order>> tempMap = makeClone(carMap);
					SimuInfo info = simulate(tempMap, t, 0);
					long smax = info.val;
					int start = 0;
					int limit = Math.min(t + 7, tlast);
					for (int i = t + 1; i <= limit; i++) {
						getProduct(tempMap, i, i);
						info = simulate(tempMap, i, 0);
						if (info.val > smax) {
							smax = info.val;
							start = i;
						}
					}
					while (t < start) {
						pw.println(-1);
						t++;
					}
					judged = true;
					continue label;
				}

			} else {
				// 荷物がなくなった場合は店に戻る
				if (carMap.isEmpty()) {
					moveAll(now, 0);
					now = 0;
					continue label;
				}
				// 配達続けるか即座に店に戻るか判定
				Map<Integer, List<Order>> tempMap = makeClone(carMap);
				// 全部配達した場合
				SimuInfo info0 = simulate(tempMap, t, now);
				long val0 = info0.val;
				int t0 = info0.tt + dist[info0.goal][0];
				val0 -= dist[info0.goal][0] * K;

				// 店に戻った場合
				SimuInfo info1 = returnShop(tempMap, t, now);
				long val1 = info1.val;
				int t1 = info1.tt;
				getProduct(tempMap, gotT, t1);
				SimuInfo info = simulate(tempMap, t1, 0);
				val1 += info.val;
				t1 = info.tt;

				// 全部配達した場合の続き
				tempMap.clear();
				getProduct(tempMap, gotT, t0);
				info = simulate(tempMap, t0, 0);
				val0 += info.val;
				t0 = info.tt;

				val1 += (t0 - t1) * K;
				if (val0 < val1) {
					for (Integer o : route[now][0]) {
						carMap.remove(o);
					}
					moveAll(now, 0);
					now = 0;
					continue label;
				}
			}

			judged = false;
			int minD = Integer.MAX_VALUE;
			for (int o : carMap.keySet()) {
				int d = dist[now][o];
				if (d < minD) {
					minD = d;
					next = o;
				}
			}
			carMap.remove(next);
			moveAll(now, next);
			now = next;
		}
		pw.flush();
	}

	/**
	 * 商品積み込み
	 * @param carMap 荷物
	 * @param gotT 前回積み込み済み時刻+1
	 * @param tt 現在時刻
	 */
	static void getProduct(Map<Integer, List<Order>> carMap, int gotT, int tt) {
		int limit = Math.min(tt, tlast);
		for (int i = gotT; i <= limit; i++) {
			for (Order o : infoList.get(i)) {
				List<Order> list = carMap.get(o.dst);
				if (list == null) {
					list = new ArrayList<>();
					carMap.put(o.dst, list);
				}
				list.add(o);
			}
		}
	}

	static Map<Integer, List<Order>> makeClone(Map<Integer, List<Order>> carMap) {
		Map<Integer, List<Order>> tempMap = new HashMap<>();
		for (Integer key : carMap.keySet()) {
			List<Order> list = carMap.get(key);
			List<Order> list2 = new ArrayList<>(list.size());
			list2.addAll(list);
			tempMap.put(key, list2);
		}
		return tempMap;
	}

	/**
	 * 引数の荷物を持って出発した場合の評価を計算
	 * @param carMap 荷物（変更は加わらない）
	 * @param tt 出発時刻
	 * @param now 出発地点
	 * @return 結果
	 */
	static SimuInfo simulate(Map<Integer, List<Order>> carMap, int tt, int now) {
		SimuInfo info = new SimuInfo();
		info.tt = tt;
		info.goal = now;
		Set<Integer> set = new HashSet<>();
		set.addAll(carMap.keySet());
		info.his = new ArrayList<>(set.size());
		while (!set.isEmpty()) {
			int minD = Integer.MAX_VALUE;
			for (int o : set) {
				int d = dist[now][o];
				if (d < minD) {
					minD = d;
					info.goal = o;
				}
			}
			set.remove(info.goal);
			info.his.add(info.goal);
			info.tt += dist[now][info.goal];
			if (info.tt > tmax) {
				return info;
			}
			for (Order o : carMap.get(info.goal)) {
				int w = info.tt - o.time;
				info.val += tmax2 - w * w;
			}
			now = info.goal;
		}
		info.val -= (info.tt - tt) * K;
		return info;
	}

	/**
	 * 焼きなまし法でより良い配達順を探索
	 */
	static SimuInfo simulatedAnnealing(SimuInfo info0, Map<Integer, List<Order>> carMap, int tt, int now) {
		long limit = System.currentTimeMillis() + 100;
		long l = System.currentTimeMillis();
		SimuInfo ret = info0;
		int size = ret.his.size();
		while (l < limit) {
			SimuInfo info = new SimuInfo();
			info.tt = tt;
			info.goal = now;
			info.his = new ArrayList<>(size);
			info.his.addAll(ret.his);
			int i1 = (int) (Math.random() * size);
			int i2 = (int) (Math.random() * size);
			Collections.swap(info.his, i1, i2);
			for (int e : info.his) {
				info.goal = e;
				info.tt += dist[now][info.goal];
				if (info.tt > tmax) {
					return info;
				}
				for (Order o : carMap.get(info.goal)) {
					int w = info.tt - o.time;
					info.val += tmax2 - w * w;
				}
				now = info.goal;
			}

			info.val -= (info.tt - tt) * K;
			if (info.val > ret.val || (int) (Math.random() * 100) < limit - l) {
				ret = info;
			}
		}
		if (ret.val > info0.val) {
			return ret;
		} else {
			return info0;
		}
	}

	/**
	 * 引数の荷物を持って店に戻る途中で得た評価を計算
	 * @param carMap 荷物（途中で配達できたものは削除する）
	 * @param tt 出発時刻
	 * @param now 出発地点
	 * @return 結果
	 */
	static SimuInfo returnShop(Map<Integer, List<Order>> carMap, int tt, int now) {
		SimuInfo info = new SimuInfo();
		info.tt = tt;
		List<Integer> list = route[now][0];
		for (int i = 1; i < list.size(); i++) {
			int next = list.get(i);
			info.tt += dist[list.get(i - 1)][next];
			if (info.tt > tmax) {
				return info;
			}
			if (carMap.containsKey(next)) {
				for (Order o : carMap.get(next)) {
					int w = info.tt - o.time;
					info.val += tmax2 - w * w;
				}
				carMap.remove(next);
			}
		}
		info.val -= (info.tt - tt) * K;
		return info;
	}

	/**
	 * 出発地点から最終目的地まで移動
	 */
	static void moveAll(int from, int to) throws Exception {
		List<Integer> list = route[from][to];
		for (int i = 1; i < list.size(); i++) {
			int d = move(list.get(i - 1), list.get(i));
			t += d;
		}
	}

	/**
	 * 地点から次の地点まで移動
	 */
	static int move(int from, int to) {
		int d = dist[from][to];
		d = Math.min(d, tmax - t);
		int to1 = to + 1;
		for (int i = 0; i < d; i++) {
			pw.println(to1);
		}
		return d;
	}

	static void dijkstra(int s) {
		Arrays.fill(dist[s], Integer.MAX_VALUE);
		dist[s][s] = 0;
		for (int i = 0; i < v; i++) {
			route[s][i] = new ArrayList<>();
		}
		route[s][s].add(s);
		PriorityQueue<Node> que = new PriorityQueue<Node>();
		Node first = new Node(s, 0);
		que.add(first);

		while (!que.isEmpty()) {
			Node cur = que.poll();
			for (Hen hen : nextList.get(cur.v)) {
				int alt = dist[s][cur.v] + hen.c;
				if (alt < dist[s][hen.v]) {
					dist[s][hen.v] = alt;
					route[s][hen.v].clear();
					route[s][hen.v].addAll(route[s][cur.v]);
					route[s][hen.v].add(hen.v);
					Node next = new Node(hen.v, alt);
					que.add(next);
				}
			}
		}
	}

	static class Hen {
		int v, c;

		public Hen(int v, int c) {
			this.v = v;
			this.c = c;
		}
	}

	static class Node implements Comparable<Node> {
		int v, d;

		public Node(int v, int d) {
			this.v = v;
			this.d = d;
		}

		public int compareTo(Node o) {
			return d - o.d;
		}
	}

	static class Order {
		int id, dst, time;
	}

	static class SimuInfo {
		long val;
		int tt, goal;
		List<Integer> his;
	}
}
