#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

/* UnionFind */

struct UnionFind{
  vector<int> data, tree_size;
  UnionFind(int s):data(s,-1),tree_size(s,1) {}
  
  int root(int x){
    if(data[x]==-1) return x;
    return data[x]=root(data[x]);
  }
  
  bool set(int x,int y){
    x=root(x);
    y=root(y);
    if(x==y) return false;
    data[y]=x;
    tree_size[x] += tree_size[y];
    tree_size[y] = 0;
    return true;
  }
  
  bool check(int x,int y){
    x=root(x);
    y=root(y);
    return x==y;
  }
  
  int size(int x){
    return tree_size[root(x)];
  }
  
};

int main(){
  int n,k;

  scanf("%d%d",&n,&k);

  int num[SIZE];
  for(int i=0;i<n;i++){
    num[i] = i;
  }
  
  for(int i=0;i<k;i++){
    int a,b;

    scanf("%d%d",&a,&b);
    a--; b--;

    swap(num[a], num[b]);
  }

  UnionFind uf(n);
  
  for(int i=0;i<n;i++){
    uf.set(i,num[i]);
  }

  int ans = 1;
  
  for(int i=0;i<n;i++){
    if(uf.root(i) == i){
      int p = uf.size(i);
      ans = (ll)(ans * p) / __gcd(ans, uf.size(i));
    }
  }

  printf("%d\n",ans);
  
  return 0;
}