Joe has been hurt on the Internet. Now he is storming around the house, destroying everything in his path.

Joe's house has n floors, each floor is a segment of m cells. Each cell either contains nothing (it is an empty cell), or has a brick or a concrete wall (always something one of three). It is believed that each floor is surrounded by a concrete wall on the left and on the right.

Now Joe is on the n-th floor and in the first cell, counting from left to right. At each moment of time, Joe has the direction of his gaze, to the right or to the left (always one direction of the two). Initially, Joe looks to the right.

Joe moves by a particular algorithm. Every second he makes one of the following actions:   If the cell directly under Joe is empty, then Joe falls down. That is, he moves to this cell, the gaze direction is preserved.  Otherwise consider the next cell in the current direction of the gaze.   If the cell is empty, then Joe moves into it, the gaze direction is preserved.  If this cell has bricks, then Joe breaks them with his forehead (the cell becomes empty), and changes the direction of his gaze to the opposite.  If this cell has a concrete wall, then Joe just changes the direction of his gaze to the opposite (concrete can withstand any number of forehead hits).  

Joe calms down as soon as he reaches any cell of the first floor.

The figure below shows an example Joe's movements around the house.

 [Image] 

Determine how many seconds Joe will need to calm down.


-----Input-----

The first line contains two integers n and m (2 ≤ n ≤ 100, 1 ≤ m ≤ 10^4).

Next n lines contain the description of Joe's house. The i-th of these lines contains the description of the (n - i + 1)-th floor of the house — a line that consists of m characters: "." means an empty cell, "+" means bricks and "#" means a concrete wall.

It is guaranteed that the first cell of the n-th floor is empty.


-----Output-----

Print a single number — the number of seconds Joe needs to reach the first floor; or else, print word "Never" (without the quotes), if it can never happen.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.


-----Examples-----
Input
3 5
..+.#
#+..+
+.#+.

Output
14
Input
4 10
...+.##+.+
+#++..+++#
++.#++++..
.+##.++#.+

Output
42

Input
2 2
..
++

Output
Never

Source: codeforces | Difficulty: HARD
Tags: Complete search


Solutions:
(n, m) = [int(i) for i in input().split()]
current_floor = list(input())
(x, t, direction) = (0, 0, 1)
for i in range(n - 1):
	floor = list(input())
	(l, r) = (x, x)
	wall = 0
	while True:
		t += 1
		if floor[x] == '.':
			break
		if x + direction == m or x + direction < 0 or current_floor[x + direction] == '#':
			wall += 1
			direction = -direction
			if wall == 2:
				print('Never')
				return
		elif current_floor[x + direction] == '+':
			wall = 0
			current_floor[x + direction] = '.'
			direction = -direction
		elif l <= x + direction and x + direction <= r:
			if direction == 1:
				t += r - x - 1
				x = r
			else:
				t += x - l - 1
				x = l
		else:
			x += direction
			r = max(r, x)
			l = min(l, x)
	(current_floor, floor) = (floor, current_floor)
print(t)


import sys
from math import *

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return map(int, minp().split())
(n, m) = mints()
a = list(minp())
x = 0
t = 0
d = 1
for i in range(n - 1):
	b = list(minp())
	l = x
	r = x
	wall = 0
	while True:
		t += 1
		if b[x] == '.':
			break
		if x + d == m or x + d < 0 or a[x + d] == '#':
			wall += 1
			d = -d
			if wall == 2:
				print('Never')
				exit(0)
		elif a[x + d] == '+':
			wall = 0
			a[x + d] = '.'
			d = -d
		elif l <= x + d and x + d <= r:
			if d == 1:
				t += r - x - 1
				x = r
			else:
				t += x - l - 1
				x = l
		else:
			x += d
			r = max(r, x)
			l = min(l, x)
	(a, b) = (b, a)
print(t)