#include <iostream>
#include <cmath>
#include <vector>
#include <utility>
#include <queue>
#include <map>
#include <string>
#include <cstring>
#include <list>
#include <algorithm>
#define INF 114514

using namespace std;

typedef pair<double,double> P;

int n;
bool check(int a[100]){
	for(int i=0;i<n;i++){
		if(a[i] != i)return false;
	}
	return true;
}

int main(void){
	int k;
	cin >> n >> k;
	vector<int> x(n),y(n);
	for(int i=0;i<k;i++){
		cin >> x[i] >> y[i];
		x[i]--;y[i]--;
	}

	map<int,int> fx;
	int a[100],b[100];
	for(int i=0;i<n;i++)a[i] = i;
	for(int i=0;i<k;i++)swap(a[x[i]],a[y[i]]);

	for(int i=0;i<n;i++)fx[i] = a[i];


	int cnt = 1;
	while(!check(a)){
		memcpy(b,a,sizeof(b));
		for(int i=0;i<n;i++)a[i] = b[fx[i]];
		cnt++;

		// for(int i=0;i<n;i++)cout << a[i] << " ";
		// 	cout << endl;
	}
	cout << cnt << endl;



	return 0;
}