#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

ll gcd(ll a, ll b) {
	if (b == 0) return abs(a);
	else return gcd(b, a % b);
}

int loop_size(int i, vector<int>& a) {
	if (a[i] == -1) return 0;
	int next = a[i];
	a[i] = -1;
	return loop_size(next, a) + 1;
}

int main() {
	int N; cin >> N;
	vector<int> a(N);
	for (int i = 0; i < N; i++)
		a[i] = i;
	int K; cin >> K;
	vector<int> X(K), Y(K);
	for (int k = 0; k < K; k++)
		cin >> X[k] >> Y[k];
	for (int k = K - 1; k >= 0; k--)
		swap(a[X[k] - 1], a[X[k]]);
	int ans = 1;
	for (int i = 0; i < N; i++) {
		if (a[i] == -1) continue;
		int x = loop_size(i, a);
		ans = ans * x / gcd(ans, x);
	}
	cout << ans << endl;
}