#include<iostream>
#include<fstream>
using namespace std;
int n,m,q[21][21]={0};
unsigned long long answer=0;
bool w[21][21]={0},used[21]={0};
void dfs(int x)
{
	if (x==n+1)
	{
		answer++;
		return;
	}
	else
	{
		for (int i=1;i<=n;i++)
		{
			if (used[i]||w[x][i])
				continue;
			used[i]=1;
			q[x][i]=1;
			x++;
			dfs(x);
			x--;
			q[x][i]=0;
			used[i]=0;
		}
	}
}
int main()
{
	ifstream fin("examone.in");
	ofstream fout("examone.out");
	cin>>n>>m;
	for (int i=0;i<m;i++)
	{
		int a,b;
		cin>>a>>b;
		w[a][b]=true;
	}
	dfs(1);
	cout<<answer;
	fin.close();
	fout.close();
	return 0;
}