#include <iostream>
#include <numeric>
#include <vector>

using lint = long long;

void solve() {
    int n, k;
    std::cin >> n >> k;

    std::vector<int> xs(n);
    std::iota(xs.begin(), xs.end(), 0);

    while (k--) {
        int x, y;
        std::cin >> x >> y;
        std::swap(xs[--x], xs[--y]);
    }

    lint ans = 1;
    for (int i = 0; i < n; ++i) {
        int j = xs[i];
        int cnt = 1;
        while (j != i) {
            j = xs[j];
            ++cnt;
        }
        ans = std::lcm(ans, cnt);
    }

    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}