import sys
from math import gcd

def main():
    N = int(sys.stdin.readline())
    K = int(sys.stdin.readline())
    bars = []
    for _ in range(K):
        X, Y = map(int, sys.stdin.readline().split())
        bars.append((X, Y))
    
    # Calculate permutation after one shuffle
    perm = list(range(N + 1))  # 0-based index for ease, perm[1..N] are used
    for i in range(1, N + 1):
        current = i
        for X, Y in bars:
            if current == X:
                current = Y
            elif current == Y:
                current = X
        perm[i] = current
    
    # Find cycles and compute LCM of cycle lengths
    visited = [False] * (N + 1)
    lcm = 1
    for i in range(1, N + 1):
        if not visited[i]:
            cycle_length = 0
            j = i
            while not visited[j]:
                visited[j] = True
                j = perm[j]
                cycle_length += 1
            current_gcd = gcd(lcm, cycle_length)
            lcm = (lcm * cycle_length) // current_gcd
    
    print(lcm)

if __name__ == "__main__":
    main()