//想定誤解法
//最小公倍数を使っていない

#include <iostream>
#include <vector>
#include <map>
#include "assert.h"
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <sstream>

using namespace std;

#define MAX_N 100
#define MAX_K 1000


int dfs(vector< vector<int> > &G, vector<bool> &visit, int pos){
	visit[pos] = true;
	int res = 1;
	for(int i=0; i<G[pos].size(); i++){
		if(visit[ G[pos][i] ] == true) continue;
		res += dfs(G, visit, G[pos][i]);
	}
	return res;
}

long long solve_dfs(const vector<int> &v){
	int n=v.size();
	vector<vector<int> > G(n);
	for(int i=0; i<n; i++){
		G[i].push_back( v[i] );
		G[ v[i] ].push_back( i );
	}

	vector<bool> visit(n,false);
	long long ans = 1;
	for(int i=0; i<n; i++){
		if(visit[i] == true) continue;
		ans *= dfs(G, visit, i);
	}
	return ans;
}

int main(){
	int N;
	cin >> N;
	assert(2<=N && N<=MAX_N);
	
	int K;
	cin >> K;
	assert(0<=K && K<=MAX_K);
	
	
	vector<int> v(N);
	for(int i=0; i<N; i++){
		v[i] = i;
	}
	for(int i=0; i<K; i++){
		int x,y;
		cin >> x >> y;
		assert(1<=x && x<= N);
		assert(1<=y && y<= N);
		assert(x<y);
		assert(x+1 == y);
		
		x--;
		y--;
		
		swap( v[x], v[y] );
	}

	cout << solve_dfs(v) << endl;
	
	return 0;
}