import java.util.Scanner;

public class Main0100 {
	public static void main(String[] args) {
		Main0100 p = new Main0100();
	}

	public Main0100() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int[] x = new int[k];
		int[] y = new int[k];
		for (int i = 0; i < x.length; i++){
			x[i] = sc.nextInt()-1;
			y[i] = sc.nextInt()-1;
		}
		solve(n, x, y);
	}

	public void solve(int n, int[] x, int[] y) {
		int[] a = new int[n];
		int[] b = new int[n];
		for(int i=0;i<n;i++){
			a[i] = i;
			b[i] = i;
		}
		
		for(int i=0;i<x.length;i++){
			int w = a[x[i]];
			a[x[i]] = a[y[i]];
			a[y[i]] = w;
		}
		
		boolean[] isVisit = new boolean[n];
		int res = 1;
		for(int i=0;i<n;i++){
			if(isVisit[i])
				continue;
			int c = 1;
			int cur = i;
			while(a[cur] != i){
				isVisit[cur] = true;
				c++;
				cur = a[cur];
			}
			res = lcm(res, c);
		}
		
		System.out.println(res);
	}
	
	private int lcm(int a, int b){
		return a/gcd(a, b) * b;
	}

	private int gcd(int a, int b) {
		if(b==0)
			return a;
		return gcd(b, a%b);
	}
	

}