### Little White's Explore

Time Limit: 1000 ms
Memory Limit: 32768 KiB

#### Problem Description

Little White likes exploring. One day she finds a maze which has a shape of a rectangle of size n*m. The coordinate of the entrance is (1,1) and the precious deposits are place at (n,m).Except for these two positions, other grids' height change from time to time. At beginning,they all have the maximum height, and every second their height change by 1(increase or decrease). The grid cannot be stayed on if its height is smaller than min. Little White can jump upwards at most high meters and downwards low meters at a time. Every time, she can choose to go to the adjacent grids(up, down, left or right) or stay at the same grid. There is a lamp at grid (n,m) with height 10. Every time she jumps from i to j, she wishes to see the light of the lamp the moment she gets onto j. Little White has a height 10 and 100 units of power,which decrease by 1 unit for every second. It takes one second for her to jump from one grid to another, and the grids' height always change after her jump. She will always be at the center of the grids.

#### Input

For each data set:

The first line give five integers, n, m, min, high, low(2<=n,m<=35,min>=0,high>=0,low>=0).

The next n lines, each has m integers, indicating the grids' initial and maximum height.The height of the grid first decreases, then begins to increase when it gets to 0, and then begins to decrease when it gets maximum...

The first line give five integers, n, m, min, high, low(2<=n,m<=35,min>=0,high>=0,low>=0).

The next n lines, each has m integers, indicating the grids' initial and maximum height.The height of the grid first decreases, then begins to increase when it gets to 0, and then begins to decrease when it gets maximum...

#### Output

Print the minimum time required to get to the precious deposits. If she cannot get to the destination, print -1 instead.

#### Sample Input

5 5 0 1 1 18 20 20 20 20 18 20 20 20 20 18 20 18 18 18 18 20 18 20 18 18 18 18 20 7 5 5 7 5 8 23 16 3 2 28 26 8 1 16 19 16 17 26 12 4 30 1 3 3 4 14 4 7 28 12

#### Sample Output

25 -1

#### Hint

hdoj2445 有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。

The rectangle has n rows and m columns. The entrance (1,1) is at the top left corner.

She can see the light if it is only blocked by the side of some grids.

Both Little White and the lamp are to be considered as points, placed at the center of the grid.

Her power must be greater than 0 at any given time during her exploration.

The rectangle has n rows and m columns. The entrance (1,1) is at the top left corner.

She can see the light if it is only blocked by the side of some grids.

Both Little White and the lamp are to be considered as points, placed at the center of the grid.

Her power must be greater than 0 at any given time during her exploration.

#### Source

2008 Asia Harbin Regional Contest Online