from math import gcd

def lcm(x,y):
    return x*y//gcd(x,y)

N=int(input())
K=int(input())

A=list(range(N+1))

for i in range(K):
    x,y=map(int,input().split())
    A[x],A[y]=A[y],A[x]


# UnionFind

Group = [i for i in range(N+1)] # グループ分け
Nodes = [1]*(N+1) # 各グループのノードの数

def find(x):
    while Group[x] != x:
        x=Group[x]
    return x

def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)

for i in range(N+1):
    Union(i,A[i])

ANS=1

for i in range(N+1):
    if find(i)==i:
        ANS=lcm(ANS,Nodes[i])

print(ANS)