#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;
typedef long long ll;

ll gcd(ll a,ll b){
	if(b==0)return a;
	return gcd(b,a%b);
}
ll lcm(ll a,ll b){
	return a*b/gcd(a,b);
}

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

	vector<ll> a(n);
	for(ll i=0;i<n;i++)a[i] = i;
	for(ll i=0;i<k;i++)swap(a[x[i]],a[y[i]]);
	map<ll,ll> fx;
	for(ll i=0;i<n;i++)fx[i] = a[i];
	//それぞれ何回で元の場所に戻るか
	vector<ll> c(n);
	for(ll i=0;i<n;i++){
		ll var = fx[i],cnt = 1;
		while(var != i){
			var = fx[var];
			cnt++;
		}
		c[i] = cnt;
	}

	ll ret = 1;
	for(ll i=0;i<n;i++)
		ret = lcm(ret,c[i]);
	cout << ret << endl;

	return 0;
}