#include <bits/stdc++.h>

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

int rec(int p, int q, const vector<int> &amida) {
  if(p == q) return 1;
  return rec(amida[p], q, amida) + 1;
}

int main() {
  // ios_base::sync_with_stdio(false);
  int N, K;
  cin >> N >> K;
  vector<int> amida(N);
  rep(i, N) amida[i] = i;
  rep(i, K) {
    int x, y;
    cin >> x >> y;
    swap(amida[x - 1], amida[y - 1]);
  }

  vector<int> cnt(N);
  rep(i, N) {
    cnt[i] = rec(amida[i], i, amida);
  }

  ll ans = 1;
  rep(i, N) ans = ans * cnt[i] / __gcd(ans, (ll)cnt[i]);

  cout << ans << endl;
  
  return 0;
}