/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.05.22 18:50:48
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

// UnionFind
class UnionFind {
private:
    vector<int> par;
public:
    UnionFind(int n) {
        par.resize(n, -1);
    }
    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return false;
        if (size(rx) < size(ry)) swap(rx, ry);
        par[rx] += par[ry];
        par[ry] = rx;
        return true;
    }
    bool same(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
    int size(int x) {
        return -par[root(x)];
    }
};
//gcd
template<typename T>
T gcd(T a, T b) {
    return b ? gcd(b, a%b) : a;
}
int main() {
    int n;
    cin >> n;
    int k;
    cin >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = i;
    }
    for (int i = 0; i < k; i++) {
        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(a[i],i);
    }
    int ans = 1;
    for (int i = 0; i < n; i++) {
        ans = ans / gcd(ans,uf.size(i)) * uf.size(i);
    }
    cout << ans << endl;
    return 0;
}