#include <bits/stdc++.h>
using namespace std;

long long gcd(long long a, long long b) {
    while (b) {
        long long c = b;
        b = a % b;
        a = c;
    }
    return a;
}
long long lcm(long long a, long long b) {
    if (!a || !b)
        return 0;
    return a * b / gcd(a, b);
}


struct UnionFind {
    vector<int> data;
    UnionFind(int n) {
        data.assign(n, -1);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y)
            return (false);
        if (data[x] > data[y])
            swap(x, y);
        data[x] += data[y];
        data[y] = x;
        return (true);
    }
    int root(int k) {
        if (data[k] < 0)
            return (k);
        return (data[k] = root(data[k]));
    }
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    int size(int k) {
        return (-data[root(k)]);
    }
};

int main() {
    int N, K;
    cin >> N >> K;

    int a[110] = {};
    for (int i = 0; i < N; i++) {
        a[i] = i;
    }

    while (K--) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        swap(a[x], a[y]);
    }

    UnionFind uf(N);
    for (int i = 0; i < N; i++) {
        uf.unite(i, a[i]);
    }

    set<long long> S;

    for (int i = 0; i < N; i++) {
        S.insert(uf.size(i));
    }

    long long ans = 1;
    for (auto& x : S) {
        ans = lcm(ans, x);
    }
    cout << ans << endl;
}