#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define pb push_back
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef long long int lli;
lli MOD = 1000000007;
int table[150] = {};
lli gcd(lli a, lli b)
{
    if (b > a)
        swap(a, b);
    return b == 0 ? a : gcd(b, a % b);
}
lli lcm(lli a, lli b)
{
    return a / gcd(a, b) * b;
}
int main()
{
    int a[1005];
    int n, m;
    cin >> n >> m;
    rep(i, n) a[i + 1] = i + 1;
    int x, y;
    rep(i, m)
    {
        cin >> x >> y;
        swap(a[x], a[y]);
    }
    int b[1005];
    for (int i = 1; i <= n; i++) {
        int cur = a[i];
        //    cout << cur << ' ';
        for (int j = 1; j <= 3 * n; cur = a[cur], j++) {
            if (cur == i) {
                b[i] = j;
                break;
            }
        }
    }
    lli ans = b[1];
    rep(i, n)
    {
        //cout << b[i + 1] << endl;
        ans = lcm(ans, b[i + 1]);
    }
    cout << ans << endl;
}