#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();++i)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int main()
{
	//for(int w,h;cin>>w>>h,w|h;){
	for(int w,h;scanf("%d%d",&w,&h),w|h;){
		//clock_t begin=clock();
		
		//vvi field(h,vi(w));
		int field[11][11];
		rep(i,h) rep(j,w)
			//cin>>field[i][j];
			scanf("%d",&field[i][j]);
		
		vector<pii> homes;
		int counter=0;
		rep(i,h) rep(j,w){
			if(field[i][j]==1){
				field[i][j]=++counter;
				homes.push_back(mp(i,j));
			}
			else if(field[i][j]==2){
				field[i][j]=0;
				homes.insert(homes.begin(),mp(i,j));
			}
			else
				field[i][j]=-1;
		}
		
		map<pair<int,int>,int> m;
		m[mp(1,0)]=1;
		foreach(iter,m){
			if(iter!=m.begin())
				m.erase(m.begin());
			//m.erase(m.begin(),iter);	// svÉÈÁ½vfðÁ³È¢ÆMLEÉÈé
			
			int state=iter->first.first;
			int prev=iter->first.second;
			if(state==(1<<homes.size())-1)
				break;
			
			//const int di[]={-1,1,0,0};
			//const int dj[]={0,0,-1,1};
			//rep(i,4){
			//	//int pi=homes[prev].first,pj=homes[prev].second;
			//	//for(;;){
			//	//	pi+=di[i];
			//	//	pj+=dj[i];
			//	for(int pi=homes[prev].first+di[i],pj=homes[prev].second+dj[i];0<=pi && pi<h && 0<=pj && pj<w;pi+=di[i],pj+=dj[i]){
			//		if(pi<0 || h<=pi || pj<0 || w<=pj)
			//			break;
			//		int homei=field[pi][pj];
			//		if(homei>=1 && !(state&(1<<homei))){
			//			m[mp(state|(1<<homei),homei)]+=iter->second;
			//			break;
			//		}
			//	}
			//}
			for(int pi=homes[prev].first-1,pj=homes[prev].second;0<=pi && pi<h && 0<=pj && pj<w;pi--){
				int homei=field[pi][pj];
				if(homei>=1 && !(state&(1<<homei))){
					m[mp(state|(1<<homei),homei)]+=iter->second;
					break;
				}
			}
			for(int pi=homes[prev].first+1,pj=homes[prev].second;0<=pi && pi<h && 0<=pj && pj<w;pi++){
				int homei=field[pi][pj];
				if(homei>=1 && !(state&(1<<homei))){
					m[mp(state|(1<<homei),homei)]+=iter->second;
					break;
				}
			}
			for(int pi=homes[prev].first,pj=homes[prev].second-1;0<=pi && pi<h && 0<=pj && pj<w;pj--){
				int homei=field[pi][pj];
				if(homei>=1 && !(state&(1<<homei))){
					m[mp(state|(1<<homei),homei)]+=iter->second;
					break;
				}
			}
			for(int pi=homes[prev].first,pj=homes[prev].second+1;0<=pi && pi<h && 0<=pj && pj<w;pj++){
				int homei=field[pi][pj];
				if(homei>=1 && !(state&(1<<homei))){
					m[mp(state|(1<<homei),homei)]+=iter->second;
					break;
				}
			}
		}
		int res=0;
		foreach(iter,m){
			int prev=iter->first.second;
			int pi=homes[prev].first,pj=homes[prev].second;
			if(pi==homes[0].first || pj==homes[0].second)
				res+=iter->second;
		}
		//cout<<res<<endl;
		printf("%d\n",res);
		
		//printf("time: %ldms\n",clock()-begin);
	}
	
	return 0;
}

Measured memory_bytes: 3568