Problem: problem

Santa Claus came from the sky to JOI town this year as well. Since every house in JOI has children, this Santa Claus must give out presents to every house in JOI. However, this year the reindeer I am carrying is a little deaf and I can only get off the top of the building, so it seems that I have to devise a little route to distribute gifts to all the houses.

JOI Town is divided into north, south, east and west, and each section is a house, a church, or a vacant lot. There is only one church in JOI town. According to the following rules, Santa Claus and reindeer depart from the church, give out one gift to every house, and then return to the church.

* This year's reindeer is a little deaf, so it can only fly straight in either the north, south, east, or west, and cannot change direction in the air.
* You can pass freely over the house where you haven't handed out the presents yet. You can get off at a house that hasn't given out presents yet. Whenever I get home, I give out presents and then take off in either direction of north, south, east or west.
* At the house in JOI town, I spend Christmas night without the fireplace until Santa Claus arrives, but after Santa Claus takes off, I turn on the fireplace. When you turn on the fireplace, smoke comes out of the chimney, so you can't pass over the house where you've finished giving out presents.
* You can pass freely over the church. However, since worship is held in the church, you cannot go down to the church until you have distributed all the presents.
* You can pass freely over the vacant lot, but you cannot get off at the vacant lot.


Create a program that asks how many directions Santa Claus and reindeer can give gifts to, given the structure of the town as input.

input

The input consists of multiple datasets. Each dataset is given in the following format.

Each dataset has n + 1 rows. On the first line, the integer m (1 ≤ m ≤ 10) and the integer n (1 ≤ n ≤ 10) are written separated by a space. In each line from the 2nd line to the n + 1th line, m of 0, 1, or 2 are written, separated by a blank, and each represents the state of each section. If we write the i-th section from the north and the j-th section from the west as (i, j) (1 ≤ i ≤ n, 1 ≤ j ≤ m), the j-th value on the i + 1 line is If the lot (i, j) is a vacant lot, it will be 0, if it is a house, it will be 1, and if it is a church, it will be 2. The number of churches is 1, and the number of houses is 1 or more and 23 or less. However, in the input data for scoring, the number of directions to be distributed does not exceed 2000000.

When both m and n are 0, it indicates the end of input. The number of data sets does not exceed 5.

Input / output example

Input example


3 2
1 0 1
1 0 2
3 3
1 1 1
1 0 1
1 1 2
0 0


Output example


2
6


<image>


Figure: All 6 directions to the second input example (numbers indicate the order of distribution)

The above question sentences and the data used for the automatic referee are the question sentences created and published by the Japan Committee for Information Olympics and the test data for scoring.



output

For each dataset, an integer indicating how many directions to distribute gifts is output on one line.

Example

Input

3 2
1 0 1
1 0 2
3 3
1 1 1
1 0 1
1 1 2
0 0


Output

2
6

Solution (in CPP):

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

using namespace std;

static const int di[] = {-1,0,1,0};
static const int dj[] = {0,1,0,-1};

typedef pair<int,int> pi;

#define MAX 16
#define fr first
#define sc second
#define MAXDIR 4

//vector<pi> houses;
int houseId[MAX][MAX];
pi charch;

struct Node{
  bool isCharch;
  bool isHouse;
  int linkmax[MAXDIR];
  pi link[MAXDIR][MAX];
  bool exist[MAXDIR];
  bool cexist[MAXDIR];
  Node():isCharch(false),isHouse(false){
    for(int i=0;i<MAXDIR;++i){
      linkmax[i]=0;
      cexist[i]=exist[i]=false;
    }
  }
};

struct state{
  char ni,nj;
  char cnt;
  int vis;
  state(){}
  state(char si, char sj, char cnt, int vis):ni(si),nj(sj),cnt(cnt),vis(vis){}
};

//void bfs(Node M[][MAX], state init, int nhouse, int &ans);

inline bool isinside(int H, int W, int i, int j){
  return 0<=i&&i<H&&0<=j&&j<W;
}

class Queue{
private:
  int p;
  state *V;
public:
  Queue():p(0){V=new state[1<<20];}
  ~Queue(){delete [] V;}
  void push(const state &t){V[p++]=t;}
  state * front(){return &V[p-1];}
  void pop(){--p;}
  bool empty(){return p==0;}
};

void bfs(const Node M[][MAX], state init, int nhouse, int &ans){
  Queue qs;
  qs.push( init );
  int ni,nj;
  int housenum=0;
  int chi=charch.fr;int chj=charch.sc;
  
  for(int k = 0; k < MAXDIR; ++k){
    housenum += M[chi][chj].linkmax[k];
  }
  
  while(!qs.empty()){
    state st_now = *( qs.front() );
    ni = st_now.ni;
    nj = st_now.nj;    
    qs.pop();
    
    if( st_now.cnt == nhouse ){
      for(int l = 0; l < MAXDIR; ++l){
	if( M[ni][nj].cexist[l] ){
	  ++ans;
	  break;
	}
      }
      continue;
    }else{

      int left = housenum;
      for(int k = 0; k < MAXDIR; ++k){
	for(int v = 0; v < M[chi][chj].linkmax[k]; ++v){
	  pi hs = M[chi][chj].link[k][v];
	  left-=(bool)(st_now.vis&(1<<houseId[hs.fr][hs.sc]));
	}
      }
      if( left == 0 )
	continue ;
      
      for(int k = 0; k < MAXDIR; ++k){
	for(int v = 0; v < M[ni][nj].linkmax[k]; ++v){
	  pi next = M[ni][nj].link[k][v];
	  int mask=1<<houseId[next.fr][next.sc];
	  if( !(st_now.vis&mask) ){
	    qs.push( state(next.fr,next.sc,st_now.cnt + 1,st_now.vis|mask) );
	    break;
	  }
	}
      }
    }
  }
  return ;
}

int main()
{
  while(true){
    int ans = 0;
    int W,H;
    scanf("%d%d", &W, &H);
    if(W==0&&W==H)break;
    int iM[MAX][MAX];
    Node M[MAX][MAX];

    int nhouse=0;

    for(int i = 0; i < H; ++i){
      for(int j = 0; j < W; ++j){
	scanf("%d", &iM[i][j]);
	if(iM[i][j]==1){
	  ++nhouse;
	  houseId[i][j]=nhouse;
	  M[i][j].isHouse=true;
	}else if(iM[i][j]==2){
	  M[i][j].isCharch=true;
	  charch = pi(i,j);
	}
      }
    }
    
    for(int i = 0; i < H; ++i){
      for(int j = 0; j < W; ++j){
	for(int k = 0; k < MAXDIR; ++k){
	  int ti=i+di[k];
	  int tj=j+dj[k];
	  while(isinside(H,W,ti,tj)){
	    if(M[ti][tj].isHouse){
	      M[i][j].link[k][ M[i][j].linkmax[k]++ ] = pi(ti,tj);
	      M[i][j].exist[k]=true;
	    }else if(M[ti][tj].isCharch){
	      M[i][j].cexist[k]=true;
	    }
	    ti+=di[k];tj+=dj[k];
	  }
	}
      }
    }
    
    state init(charch.fr,charch.sc,0,0);
    bfs(M,init,nhouse,ans);
    printf("%d\n", ans);

  }
  return 0;

}