#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b){
	if(b==0) return a;
	return gcd(b, a%b);
}
ll lcm(ll a, ll b){
	return a/gcd(a, b)*b;
}
int n, k;
int p[110];
int main()
{
	cin>>n>>k;
	for(int i=0; i<n; i++) p[i]=i;
	for(int i=0; i<k; i++){
		int x, y; cin>>x>>y;
		x--; y--;
		swap(p[x], p[y]);
	}
	bool used[110]={};
	ll ans=1;
	for(int i=0; i<n; i++){
		if(used[i]) continue;
		int x=i, cnt=0;
		while(!used[x]){
			used[x]=1;
			x=p[x];
			cnt++;
		}
		ans=lcm(ans, cnt);
	}
	cout<<ans<<endl;
	return 0;
}