The Berland road network consists of n cities and of m bidirectional roads. The cities are numbered from 1 to n, where the main capital city has number n, and the culture capital — number 1. The road network is set up so that it is possible to reach any city from any other one by the roads. Moving on each road in any direction takes the same time.

All residents of Berland are very lazy people, and so when they want to get from city v to city u, they always choose one of the shortest paths (no matter which one).

The Berland government wants to make this country's road network safer. For that, it is going to put a police station in one city. The police station has a rather strange property: when a citizen of Berland is driving along the road with a police station at one end of it, the citizen drives more carefully, so all such roads are considered safe. The roads, both ends of which differ from the city with the police station, are dangerous.

Now the government wonders where to put the police station so that the average number of safe roads for all the shortest paths from the cultural capital to the main capital would take the maximum value.

Input

The first input line contains two integers n and m (2 ≤ n ≤ 100, <image>) — the number of cities and the number of roads in Berland, correspondingly. Next m lines contain pairs of integers vi, ui (1 ≤ vi, ui ≤ n, vi ≠ ui) — the numbers of cities that are connected by the i-th road. The numbers on a line are separated by a space. 

It is guaranteed that each pair of cities is connected with no more than one road and that it is possible to get from any city to any other one along Berland roads.

Output

Print the maximum possible value of the average number of safe roads among all shortest paths from the culture capital to the main one. The answer will be considered valid if its absolute or relative inaccuracy does not exceed 10 - 6.

Examples

Input

4 4
1 2
2 4
1 3
3 4


Output

1.000000000000


Input

11 14
1 2
1 3
2 4
3 4
4 5
4 6
5 11
6 11
1 8
8 9
9 7
11 7
1 10
10 4


Output

1.714285714286

Note

In the first sample you can put a police station in one of the capitals, then each path will have exactly one safe road. If we place the station not in the capital, then the average number of safe roads will also make <image>.

In the second sample we can obtain the maximum sought value if we put the station in city 4, then 6 paths will have 2 safe roads each, and one path will have 0 safe roads, so the answer will equal <image>.

Difficulty: HARD
Tags: Dynamic programming

Graph algorithms

Shortest paths
Skill types: Dynamic programming

Starter code:

Solutions:
s = list(map(int, input().split()))
n = s[0]
m = s[1]
roads = []
Adj = []
for i in range(0, n + 1):
	roads.append([])
	Adj.append([False] * (n + 1))
for i in range(0, m):
	s = list(map(int, input().split()))
	roads[s[0]].append(s[1])
	roads[s[1]].append(s[0])
	Adj[s[0]][s[1]] = True
	Adj[s[1]][s[0]] = True
Dist = [200] * (n + 1)
Q = [1]
Dist[1] = 0
while len(Q) > 0:
	curr = Q.pop(0)
	for nex in roads[curr]:
		if Dist[nex] == 200:
			Dist[nex] = Dist[curr] + 1
			Q.append(nex)
Levels = []
for l in range(0, 100):
	Levels.append([])
	for p in range(1, n + 1):
		if Dist[p] == l:
			Levels[l].append(p)
fromOne = [0] * (n + 1)

def fo(b):
	if fromOne[b] > 0:
		return fromOne[b]
	if b == 1:
		return 1
	ans = 0
	for p in Levels[Dist[b] - 1]:
		if Adj[p][b]:
			ans += fo(p)
	fromOne[b] = ans
	return ans
toN = [0] * (n + 1)

def tN(b):
	if toN[b] > 0:
		return toN[b]
	if b == n:
		return 1
	ans = 0
	for p in Levels[Dist[b] + 1]:
		if Adj[p][b]:
			ans += tN(p)
	toN[b] = ans
	return ans
best = fo(n)
for policeStation in range(2, n):
	safe = fo(policeStation) * tN(policeStation) * 2
	best = max(best, safe)
print(round(best / fo(n), 10))


(n, m) = map(int, input().split())
adj = [[] for i in range(n)]
for _ in range(m):
	(a, b) = map(int, input().split())
	adj[a - 1].append(b - 1)
	adj[b - 1].append(a - 1)

def bfs(s):
	(q, d, res) = ([s], [-1] * n, [0] * n)
	d[s] = 0
	res[s] = 1
	i = 0
	while i < len(q):
		v = q[i]
		for u in adj[v]:
			if d[u] == -1:
				d[u] = d[v] + 1
				q.append(u)
			if d[u] == d[v] + 1:
				res[u] += res[v]
		i += 1
	return (q, d, res)
(q0, d0, res0) = bfs(0)
(q1, d1, res1) = bfs(n - 1)
min_dist = d0[n - 1]
num_paths = res0[n - 1]
res = num_paths
for v in range(1, n - 1):
	if d0[v] + d1[v] == min_dist:
		res = max(res, 2 * res0[v] * res1[v])
print('%.7f' % (res / num_paths))


from collections import deque
(n, m) = [int(i) for i in input().split()]
g = [[] for i in range(n)]
for i in range(m):
	(u, v) = [int(i) - 1 for i in input().split()]
	g[u].append(v)
	g[v].append(u)

def bfs(s):
	d = [-1] * n
	ct = [0.0] * n
	q = deque()
	d[s] = 0
	ct[s] = 1.0
	q.append(s)
	while q:
		v = q.popleft()
		for u in g[v]:
			if d[u] == -1:
				q.append(u)
				d[u] = d[v] + 1
				ct[u] += ct[v]
			elif d[u] == d[v] + 1:
				ct[u] += ct[v]
	return (d, ct)
ds = []
cts = []
for i in range(n):
	(d, ct) = bfs(i)
	ds.append(d)
	cts.append(ct)
x = cts[0][n - 1]
r = 1.0
for i in range(1, n - 1):
	if ds[0][i] + ds[i][n - 1] == ds[0][n - 1]:
		r = max(r, 2.0 * cts[0][i] * cts[i][n - 1] / x)
print('{0:.10f}'.format(r))


read_line = lambda : map(int, input().split(' '))
(n, m) = read_line()
g = [[] for i in range(n)]
while m:
	(a, b) = map(lambda x: x - 1, read_line())
	g[a].append(b)
	g[b].append(a)
	m -= 1

def bfs(v0):
	q = [v0]
	d = [-1] * n
	d[v0] = 0
	ways = [0] * n
	ways[v0] = 1
	i = 0
	while i < len(q):
		v = q[i]
		for w in g[v]:
			if d[w] == -1:
				d[w] = d[v] + 1
				q.append(w)
			if d[w] == d[v] + 1:
				ways[w] += ways[v]
		i += 1
	return (q, d, ways)
(q0, d0, ways0) = bfs(0)
(q1, d1, ways1) = bfs(n - 1)
min_dist = d0[n - 1]
num_paths = ways0[n - 1]
ans = num_paths
for v in range(1, n - 1):
	if d0[v] + d1[v] == min_dist:
		ans = max(ans, 2 * ways0[v] * ways1[v])
print('{:.7f}'.format(ans / num_paths))


from collections import deque

def put():
	return map(int, input().split())

def bfs(s):
	(q, dis, cnt) = (deque(), [-1] * n, [0] * n)
	q.append(s)
	(dis[s], cnt[s]) = (0, 1)
	while q:
		x = q.popleft()
		for y in graph[x]:
			if dis[y] == -1:
				dis[y] = dis[x] + 1
				cnt[y] += cnt[x]
				q.append(y)
			elif dis[y] == dis[x] + 1:
				cnt[y] += cnt[x]
	return (cnt, dis)

def solve():
	for _ in range(m):
		(x, y) = put()
		(x, y) = (x - 1, y - 1)
		graph[x].append(y)
		graph[y].append(x)
	(c, d) = bfs(0)
	ans = 0
	for i in range(n):
		(x, y) = bfs(i)
		if y[0] + y[n - 1] == d[n - 1]:
			z = x[0] * x[n - 1]
			if i not in [0, n - 1]:
				z *= 2
			ans = max(ans, z)
	ans /= c[n - 1]
	print(ans)
(n, m) = put()
graph = [[] for i in range(n)]
solve()