#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl
using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

ll gcd(ll a,ll b)
{
    if(a % b == 0){
        return b;
    }else{
        return gcd(b,a%b);
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,K;
    cin >> n >> K;
    vector<int> vec(n);
    rep(i,n){
        vec[i] = i;
    }
    rep(i,K){
        int x,y;
        cin >> x >> y;
        swap(vec[x-1],vec[x]);
    }
    vector<int> ret(n);
    rep(i,n){
        int nw = i;
        int num = 0;
        while(1){
            nw = vec[nw];
            num++;
            if(i == nw){
                break;
            }
        }
        ret[i] = num;
    }
    ll ans = ret[0];
    rep(i,n-1){
        ans = ans / gcd(ans,ret[i+1]) * ret[i+1];
    }
    cout << ans << endl;
    return 0;
}