Twilight Sparkle learnt that the evil Nightmare Moon would return during the upcoming Summer Sun Celebration after one thousand years of imprisonment on the moon. She tried to warn her mentor Princess Celestia, but the princess ignored her and sent her to Ponyville to check on the preparations for the celebration.

<image>

Twilight Sparkle wanted to track the path of Nightmare Moon. Unfortunately, she didn't know the exact path. What she knew is the parity of the number of times that each place Nightmare Moon visited. Can you help Twilight Sparkle to restore any path that is consistent with this information?

Ponyville can be represented as an undirected graph (vertices are places, edges are roads between places) without self-loops and multi-edges. The path can start and end at any place (also it can be empty). Each place can be visited multiple times. The path must not visit more than 4n places.

Input

The first line contains two integers n and m (2 ≤ n ≤ 105; 0 ≤ m ≤ 105) — the number of places and the number of roads in Ponyville. Each of the following m lines contains two integers ui, vi (1 ≤ ui, vi ≤ n; ui ≠ vi), these integers describe a road between places ui and vi.

The next line contains n integers: x1, x2, ..., xn (0 ≤ xi ≤ 1) — the parity of the number of times that each place must be visited. If xi = 0, then the i-th place must be visited even number of times, else it must be visited odd number of times.

Output

Output the number of visited places k in the first line (0 ≤ k ≤ 4n). Then output k integers — the numbers of places in the order of path. If xi = 0, then the i-th place must appear in the path even number of times, else i-th place must appear in the path odd number of times. Note, that given road system has no self-loops, therefore any two neighbouring places in the path must be distinct.

If there is no required path, output -1. If there multiple possible paths, you can output any of them.

Examples

Input

3 2
1 2
2 3
1 1 1


Output

3
1 2 3


Input

5 7
1 2
1 3
1 4
1 5
3 4
3 5
4 5
0 1 0 1 0


Output

10
2 1 3 4 5 4 5 4 3 1 

Input

2 0
0 0


Output

0

Source: codeforces | Difficulty: HARD
Tags: Graph algorithms

Graph traversal

Constructive algorithms


Solutions:
import sys
readline = sys.stdin.readline
(N, M) = map(int, readline().split())
Edge = [[] for _ in range(N)]
for _ in range(M):
	(u, v) = map(int, readline().split())
	u -= 1
	v -= 1
	Edge[u].append(v)
	Edge[v].append(u)
Pr = list(map(int, readline().split()))
Po = Pr[:]
if sum(Pr) == 0:
	print(0)
else:
	st = Pr.index(1)
	stack = [~st, st]
	used = set([st])
	ans = []
	P = [None] * N
	pre = None
	while stack:
		vn = stack.pop()
		if vn >= 0:
			Pr[vn] ^= 1
			ans.append(vn)
			for vf in Edge[vn]:
				if vf in used:
					continue
				P[vf] = vn
				stack.append(~vf)
				stack.append(vf)
				used.add(vf)
		else:
			vn = ~vn
			if pre != vn:
				Pr[vn] ^= 1
				ans.append(vn)
			if vn == st:
				if Pr[vn]:
					ans.pop()
					Pr[vn] ^= 1
				break
			if Pr[vn]:
				ans.append(P[vn])
				ans.append(vn)
				Pr[vn] ^= 1
				Pr[P[vn]] ^= 1
			if stack and stack[-1] >= 0:
				ans.append(P[vn])
				Pr[P[vn]] ^= 1
		pre = vn
	for a in ans:
		Po[a] ^= 1
	for (a, b) in zip(ans, ans[1:]):
		assert a != b
	if sum(Po):
		print(-1)
	else:
		print(len(ans))
		assert len(ans) <= 4 * N
		print(*[a + 1 for a in ans])


def main():
	(n, m) = read()
	edges = [[] for _ in range(n + 1)]
	for i in range(m):
		(a, b) = read()
		edges[a].append(b)
		edges[b].append(a)
	parity = [0] + read()
	mn = 0
	while mn < n + 1 and (not parity[mn]):
		mn += 1
	if mn == n + 1:
		print(0)
		return
	visited = [0] * (n + 1)
	dfs_stack = [mn]
	dfs_path = []
	while dfs_stack:
		dfs(dfs_stack, dfs_path, visited, edges, parity)
	if parity[mn]:
		dfs_path.pop()
		parity[mn] = 0
	if sum(parity):
		print(-1)
	else:
		print(len(dfs_path))
		print(' '.join(map(str, dfs_path)))

def dfs(dfs_stack, dfs_path, visited, edges, parity):
	v = dfs_stack.pop()
	if v > 0:
		if visited[v]:
			dfs_stack.pop()
			return
		visited[v] = 1
		dfs_path.append(v)
		parity[v] = 1 - parity[v]
		for i in edges[v]:
			dfs_stack.append(-v)
			dfs_stack.append(i)
	else:
		v = -v
		u = dfs_path[-1]
		dfs_path.append(v)
		if parity[u]:
			dfs_path.append(u)
			dfs_path.append(v)
			parity[u] = 1 - parity[u]
		else:
			parity[v] = 1 - parity[v]

def read(mode=2):
	inputs = input().strip()
	if mode == 0:
		return inputs
	if mode == 1:
		return inputs.split()
	if mode == 2:
		return list(map(int, inputs.split()))

def read_str():
	return read(0)

def read_int():
	return read(2)[0]

def write(s='\n'):
	if isinstance(s, list):
		s = ' '.join(map(str, s))
	s = str(s)
	print(s, end='')
main()


import sys
input = sys.stdin.readline

def solve():
	(n, m) = map(int, input().split())
	g = [[] for i in range(n + 1)]
	for i in range(m):
		(u, v) = map(int, input().split())
		g[u].append(v)
		g[v].append(u)
	a = list(map(int, input().split()))
	s = None
	for i in range(1, n + 1):
		if a[i - 1] == 1:
			s = i
			break
	if s is None:
		print(0)
		return
	st = [[s, 0]]
	was = [False] * (n + 1)
	was[s] = True
	e = [s]
	while len(st):
		(x, i) = st[-1]
		if i < len(g[x]):
			v = g[x][i]
			if was[v]:
				st[-1][1] += 1
			else:
				st[-1][1] += 1
				e.append(v)
				was[v] = True
				st.append([v, 0])
		else:
			st.pop()
			if len(st) > 0:
				e.append(st[-1][0])
	for i in range(1, n + 1):
		if a[i - 1] == 1 and was[i] == False:
			print(-1)
			return
	u = [False] * len(e)
	for i in range(len(e) - 1, -1, -1):
		if was[e[i]]:
			u[i] = True
			was[e[i]] = False
	ans = []
	for i in range(len(e) - 1):
		v = e[i]
		ans.append(v)
		a[v - 1] ^= 1
		if i > 0 and u[i - 1] and (a[e[i - 1] - 1] == 1):
			a[e[i - 1] - 1] ^= 1
			ans.append(e[i - 1])
			a[v - 1] ^= 1
			ans.append(v)
	if a[e[-1] - 1] == 1 or (len(e) > 1 and u[len(e) - 2] and (a[e[-2] - 1] == 1)):
		ans.append(e[-1])
		a[e[-1] - 1] ^= 1
		if len(e) > 1 and u[len(e) - 2] and (a[e[-2] - 1] == 1):
			ans.append(e[-2])
			a[e[-2] - 1] ^= 1
			if a[e[-1] - 1] == 1:
				ans.append(e[-1])
	print(len(ans))
	print(' '.join(map(str, ans)))
solve()