题号：NC223765
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
In a magical country, the country is a two-dimensional matrix of 
lines 
rows, the 
representative can walk road, 
represent a wall, can not pass.
little F to set off for the company 
to work from home 
every day, in this magical land, every second of the speed of walking with the real life is not the same:
1、if one person always in one direction is one second can walk one or two square , of course, You can't go through a wall while going straight through two blocks.
2、If you want to turn, you can only go one square in one second.
Now little F wants to know what is the minimum time from home to the company? If there is no feasible way to output -1. At begining, it is considered to go straight in every direction from home.
We make sure that the data has one and only one S and E.
输入描述:
The first line contains two integers
represents the length and width of the matrix
Then
for the road,
for the wall,
for the home of little F, and
for the location of the company
输出描述:
Print one integer — the minimum time from home to the company