#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

// 最大公約数
long long gcd(long long a, long long b){
    while(b != 0){
        long long tmp = a % b;
        a = b;
        b = tmp;
    }
    return a;
}

// 最小公倍数
long long lcm(long long a, long long b){
    return a / gcd(a, b) * b;
}

int main()
{
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for(int i=0; i<n; ++i)
        a[i] = i;

    while(--k >= 0){
        int x, y;
        cin >> x >> y;
        swap(a[x-1], a[y-1]);
    }

    vector<bool> check(n, false);
    long long ret = 1;
    for(int i=0; i<n; ++i){
        if(check[i])
            continue;

        int k = i;
        int len = 0;
        while(!check[k]){
            check[k] = true;
            k = a[k];
            ++ len;
        }
        ret = lcm(ret, len);
    }
    cout << ret << endl;

    return 0;
}