#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long gcd(long long x, long long y) {
	do {
		if (x < y) {
			swap(x, y);
		}
		x = x % y;
	} while (x > 0LL);
	return y;
}

long long lcm(long long x, long long y) {
	return x * y / gcd(x, y);
}

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> x(k), y(k);
	for (int i = 0; i < k; ++i) {
		cin >> x[i] >> y[i];
	}
	vector<int> oldPositions(n);
	for (int i = 0; i < n; ++i) {
		oldPositions[i] = i;
	}
	for (int i = 0; i < k; ++i) {
		swap(oldPositions[x[i] - 1], oldPositions[y[i] - 1]);
	}
	vector<int> newPositions(n);
	for (int i = 0; i < n; ++i) {
		newPositions[oldPositions[i]] = i;
	}
	vector<int> movements(n);
	for (int i = 0; i < n; ++i) {
		int movement = 1;
		for (int position = newPositions[i];
			position != i; 
			position = newPositions[position]) {
			++movement;
		}
		movements[i] = movement;
	}
	long long result = 1;
	for (int i = 0; i < n; ++i) {
		result = lcm(result, movements[i]);
	}
	cout << result << endl;
	return 0;
}