import sys
input = sys.stdin.readline

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]
    
N = int(input())
L = list(range(N))
K = int(input())
for _ in range(K):
    X, Y = map(int, input().split())
    X, Y = X - 1, Y - 1
    L[X], L[Y] = L[Y], L[X]

U = UnionFind(N)
ans = 1

from math import lcm
S = set()
for i in range(N):
    U.union(i, L[i])

for i in range(N):
    if U.find(i) in S:
        continue
    ans = lcm(ans, U.get_size(i))
    S.add(U.find(i))

print(ans)