class Permutation_Error(Exception):
    pass

class Permutation():
    def __init__(self,n,p=[]):
        if p==[]:
            self.p=[i for i in range(n)]
        else:
            self.p=p
            
        self.n=n

    def __str__(self):
        return "["+", ".join(map(str,self.p))+"]"

    def __mul__(self,other):
        T=[]
        n=max(self.n,other.n)

        for i in range(n):
            T.append(self.Replace(other.Replace(i)))

        return Permutation(n,T)

    def __truediv__(self,other):
        pass

    def __sgn__(self):
        if self.Minimum_Transposition()%2:
            return -1
        else:
            return 1
        
    def Inverse(self):
        Q=list(range(self.n))
        for k in range(self.n):
            Q[self.p[k]]=k
        return Permutation(self.n,Q)

    def Transposition(self,u,v):
        a=self.p.index(u)
        b=self.p.index(v)
        
        self.p[a]=v
        self.p[b]=u

    def Minimum_Transposition(self):
        X=self.Cycle_Division()

        T=0
        for d in X:
            T+=len(d)-1
        return T
    
    def Cycle_Multiplication(self,*C):
        X=[self.p.index(k) for k in C]

        N=len(C)
        for i in range(N):
            self.p[X[i]]=C[(i+1)%N]

    def Cycle_Division(self):
        T=[False]*self.n
        k=0
        v=0

        A=[]
        for k in range(self.n):
            if (not T[k]) and self.p[k]!=k:
                v=k
                B=[k]
                while self.p[v]!=k:
                    v=self.p[v]
                    T[v]=True
                    B.append(v)
                A.append(B)
        return A
            
    def Replace(self,x):
        if x<self.n:
            return self.p[x]
        else:
            return x

    def Order(self):
        L=self.Cycle_Division()
        C=[]
        for K in L:
            C.append(len(K))

        if C:
            return LCM(*C)
        else:
            return 1
    
#-------------------------------------------------
def Is_Identity(P):
    return self.p==list(range(self.n))
    
#以下Orderを用いる時に必要
#最大公約数
def gcd(m,n):
    x,y=max(m,n),min(m,n)
    if x%y==0:
        return y
    else:
        while x%y!=0:
            z=x%y
            x,y=y,z
        else:
            return z
        
from functools import reduce
def GCD(*X):
    return reduce(gcd,X)

#最小公倍数
def lcm(m,n):
    return (m//gcd(m,n))*n

def LCM(*X):
    return reduce(lcm,X)

#-------------------------------------------------------------------------------
N=int(input())
K=int(input())

P=Permutation(N+1)
for _ in range(K):
    a,b=map(int,input().split())
    P.Transposition(a,b)

print(P.Order())