#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <queue>
#include <stack>
#include <deque>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <complex>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cstdlib>
#include <cctype>

#define REP(i,m,n) for(int i=m;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define rp(i,c) rep(i,(int)c.size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(u) (u).rbegin(),(u).rend()
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl
#define v_delete(a,b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector< T > >
#define init(a,b) memset((a), (b), sizeof((a)))

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf=1<<28;
const double EPS=1e-9;
const long long INF = 100001000010000100ll;

template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
typedef pair<int,int> pii;

int W, He, H, S;

vector<pii>h;

int m[101][101];

int im[101][101];

int rec(int n, int state){

	if(state == (1 << H) - 1){

		int reach = 0;
		REP(i, 1, He){
			if(h[n].first + i >= He)
				break;
			if(im[h[n].first + i][h[n].second] == 0){
				reach = 1;
			}

		}
		REP(i, 1, He){
			if(h[n].first - i < 0)
				break;
			if(im[h[n].first - i][h[n].second] == 0){
				reach = 1;
			}

		}
		REP(i, 1, W){
			if(h[n].second + i >= W){
				break;
			}
			if(im[h[n].first][h[n].second + i] == 0){
				reach = 1;
			}

		}
		REP(i, 1, W){
			if(h[n].second - i < 0){
				break;
			}
			if(im[h[n].first][h[n].second - i] == 0){
				reach = 1;
			}

		}

		return reach;
	}

	int ans=0;

	REP(i, 1, He){
		if(h[n].first + i >= He)
			break;
		if(im[h[n].first + i][h[n].second] != -1){
			if(!((state >> im[h[n].first + i][h[n].second]) & 1)){
				ans += rec(im[h[n].first + i][h[n].second], state | (1 << im[h[n].first + i][h[n].second]));
				break;
			}
		}
	}

	REP(i, 1, He){
		if(h[n].first - i < 0)
			break;
		if(im[h[n].first - i][h[n].second] != -1){
			if(!((state >> im[h[n].first - i][h[n].second]) & 1)){
				ans += rec(im[h[n].first - i][h[n].second], state | (1 << im[h[n].first - i][h[n].second]));
				break;
			}
		}
	}

	REP(i, 1, W){
		if(h[n].second + i >= W){
			break;
		}
		if(im[h[n].first][h[n].second + i] != -1){
			if(!((state >> im[h[n].first][h[n].second + i]) & 1)){
				ans += rec(im[h[n].first ][h[n].second + i], state | (1 << im[h[n].first ][h[n].second + i]));
				break;
			}
		}
	}

	REP(i, 1, W){
		if(h[n].second - i < 0){
			break;
		}
		if(im[h[n].first][h[n].second - i] != -1){
			if(!((state >> im[h[n].first ][h[n].second - i]) & 1)){
				ans += rec(im[h[n].first][h[n].second - i], state | (1 << im[h[n].first ][h[n].second -i]));
				break;
			}
		}

	}

	//cout << ans << endl;

	return ans;
}

int main(){

	while(cin >> W >> He, (W && He)){

		h.clear();

		memset(m, -1, sizeof(m));

		rep(i, He){
			rep(j, W){
				cin >> m[i][j];
				if(m[i][j]==1){
					h.pb(mp(i, j));
				}else if(m[i][j]==2){
					h.insert(h.begin(), mp(i, j));
				}
			}
		}

		H=h.size();

		memset(im, -1, sizeof(im));

		rep(i, H){
			im[h[i].first][h[i].second] = i;
		}
		cout << rec(0, 1) << endl;

	}



	return 0;

}

Measured memory_bytes: 1288