from math import gcd
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)


class UF_tree:
    def __init__(self, n):
        self.root = [-1] * (n + 1)
        self.rank = [0] * (n + 1)

    def find(self, x):
        if self.root[x] < 0:
            return x
        else:
            self.root[x] = self.find(self.root[x])
            return self.root[x]

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

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        elif self.rank[x] < self.rank[y]:
            self.root[y] += self.root[x]
            self.root[x] = y
        else:
            self.root[x] += self.root[y]
            self.root[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1

    def size(self, x):
        return -self.root[self.find(x)]


N = int(input())
*num, = range(N)

K = int(input())
for _ in range(K):
    x, y = map(int, input().split())
    y -= 2
    num[x], num[y] = num[y], num[x]

uf = UF_tree(N)
for a, b in enumerate(num):
    uf.unite(a, b)

ans = 1
for i in range(N):
    sz = uf.size(i)
    g = gcd(ans, sz)
    ans = ans // g * sz
print(ans)