from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline
class DSU:
    def __init__(self, n):
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a, b):
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        x, y = self.leader(a), self.leader(b)
        if x == y: return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a, b):
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        return self.leader(a) == self.leader(b)

    def leader(self, a):
        assert 0 <= a < self._n
        if self.parent_or_size[a] < 0: return a
        self.parent_or_size[a] = self.leader(self.parent_or_size[a])
        return self.parent_or_size[a]

    def size(self, a):
        assert 0 <= a < self._n
        return -self.parent_or_size[self.leader(a)]

    def groups(self):
        leader_buf = [self.leader(i) for i in range(self._n)]
        result = [[] for _ in range(self._n)]
        for i in range(self._n): result[leader_buf[i]].append(i)
        return [r for r in result if r != []]


N = int(input())
K = int(input())
D = DSU(N)
X = [i for i in range(N)]
for _ in range(K):
    x,y = map(int,input().split())
    x -= 1
    y -= 1
    X[x],X[y] = X[y],X[x]

for i,x in enumerate(X):
    D.merge(i,x)

A = []
for i in range(N):
    now = i
    cnt = 1
    while X[now]!=i:
        now = X[now]
        cnt += 1
    A.append(cnt)

def lcm(x,y):
    
    return x*y//math.gcd(x,y)
    
ans = 1
for a in A:
    ans = lcm(ans,a)
print(ans)