Problem: Mr. Schwarz was a famous powerful pro wrestler. He starts a part time job as a warehouseman. His task is to move a cargo to a goal by repeatedly pushing the cargo in the warehouse, of course, without breaking the walls and the pillars of the warehouse.

There may be some pillars in the warehouse. Except for the locations of the pillars, the floor of the warehouse is paved with square tiles whose size fits with the cargo. Each pillar occupies the same area as a tile.

<image>

Initially, the cargo is on the center of a tile. With one push, he can move the cargo onto the center of an adjacent tile if he is in proper position. The tile onto which he will move the cargo must be one of (at most) four tiles (i.e., east, west, north or south) adjacent to the tile where the cargo is present.

To push, he must also be on the tile adjacent to the present tile. He can only push the cargo in the same direction as he faces to it and he cannot pull it. So, when the cargo is on the tile next to a wall (or a pillar), he can only move it along the wall (or the pillar). Furthermore, once he places it on a corner tile, he cannot move it anymore.

He can change his position, if there is a path to the position without obstacles (such as the cargo and pillars) in the way. The goal is not an obstacle. In addition, he can move only in the four directions (i.e., east, west, north or south) and change his direction only at the center of a tile.

As he is not so young, he wants to save his energy by keeping the number of required pushes as small as possible. But he does not mind the count of his pedometer, because walking is very light exercise for him.

Your job is to write a program that outputs the minimum number of pushes required to move the cargo to the goal, if ever possible.



Input

The input consists of multiple maps, each representing the size and the arrangement of the warehouse. A map is given in the following format.


w h
d11 d12 d13 ... d1w
d21 d22 d23 ... d2w
...
dh1 dh2 dh3 ... dhw


The integers w and h are the lengths of the two sides of the floor of the warehouse in terms of widths of floor tiles. w and h are less than or equal to 7. The integer dij represents what is initially on the corresponding floor area in the following way.

0: nothing (simply a floor tile)

1: a pillar

2: the cargo

3: the goal

4: the warehouseman (Mr. Schwarz)

Each of the integers 2, 3 and 4 appears exactly once as dij in the map. Integer numbers in an input line are separated by at least one space character. The end of the input is indicated by a line containing two zeros.

Output

For each map, your program should output a line containing the minimum number of pushes. If the cargo cannot be moved to the goal, -1 should be output instead.

Example

Input

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


Output

5
-1
11
8

Solution (in CPP):

Solution:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

typedef pair<int, int> P;

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};

int H, W;
int field[8][8];
bool arrive[8][8][8][8][8][8];

void init(){
  memset(field, 0, sizeof(field));
  memset(arrive, false, sizeof(arrive));
}

void canArrive(int bx, int by, int sx, int sy){
  int tmp_field[8][8];
  memset(tmp_field, 0, sizeof(tmp_field));
  for(int i = 0 ; i < H ; i++){
    for(int j = 0 ; j < W ; j++){
      if(field[i][j] != 1) tmp_field[i][j] = 0;
      else tmp_field[i][j] = field[i][j];
    }
  }
  
  tmp_field[by][bx] = 2;

  queue<P> que;
  que.push(P(sx, sy));
  while(!que.empty()){
    P q = que.front(); que.pop();
    arrive[by][bx][sy][sx][q.second][q.first] = true;
    
    for(int i = 0 ; i < 4 ; i++){
      int nx = q.first + dx[i], ny = q.second + dy[i];
      if(nx < 0 || nx >= W || ny < 0 || ny >= H) continue;
      if(tmp_field[ny][nx] != 0) continue;
      if(arrive[by][bx][sy][sx][ny][nx]) continue;
      que.push(P(nx, ny));
    }    
  }
}


struct State{
  int x, y, sx, sy, cost;
  State(int x, int y, int sx, int sy, int cost) : x(x), y(y), sx(sx), sy(sy), cost(cost){}
};

const bool operator < (const State &a, const State &b){
  return a.cost > b.cost;
}

int bfs(){
  int sx, sy, bx, by;
  for(int i = 0 ; i < H ; i++){
    for(int j = 0 ; j < W ; j++){
      if(field[i][j] == 2) bx = j, by = i;
      if(field[i][j] == 4) sx = j, sy = i;
    }
  }
  
  priority_queue<State> que;
  que.push(State(bx, by, sx, sy, 0));
  
  bool used[8][8][8][8];
  memset(used, false, sizeof(used));
  
  while(!que.empty()){
    State p = que.top(); que.pop();

    if(field[p.y][p.x] == 3) return p.cost;    

    if(used[p.y][p.x][p.sy][p.sx]) continue;
    used[p.y][p.x][p.sy][p.sx] = true;
    
    for(int i = 0 ; i < 4 ; i++){
      int nx1, nx2, ny1, ny2;
      nx1 = p.x + dx[i], ny1 = p.y + dy[i];
      nx2 = p.x - dx[i], ny2 = p.y - dy[i];
      if(nx1 < 0 || nx1 >= W || ny1 < 0 || ny1 >= H ||
	 nx2 < 0 || nx2 >= W || ny2 < 0 || ny2 >= H) continue;
      if(field[ny1][nx1] == 1) continue;
      if(field[ny2][nx2] == 1) continue;
      if(!arrive[p.y][p.x][p.sy][p.sx][ny2][nx2]) continue;      
      que.push(State(nx1, ny1, nx2, ny2, p.cost+1));
    }    
  }
  return -1;
}

int main(){
  while(cin >> W >> H, W|H){
    init();
    
    for(int i = 0 ; i < H ; i++)
      for(int j = 0 ; j < W ; j++) cin >> field[i][j];
    
    for(int by = 0 ; by < H ; by++){
      for(int bx = 0 ; bx < W ; bx++){
	if(field[by][bx] == 1) continue;
	for(int sy = 0 ; sy < H ; sy++){
	  for(int sx = 0 ; sx < W ; sx++){
	    if(sy == by && sx == bx) continue;
	    if(field[sy][sx] == 1) continue;
	    canArrive(bx, by, sx, sy);
	  }
	}
      }
    }

    cout << bfs() << endl;
    
  }

  return 0;
}