#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); int n, k; int x[1010], y[1010]; ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a%b); } ll lcm(ll a, ll b) { return a * b / gcd(a, b); } ll solve() { int order[n]; for (int i = 0; i < n; i++) order[i] = i; for (int i = k-1; i >= 0; i--) { swap(order[x[i]], order[y[i]]); } vector vec; bool used[n]; memset(used, false, sizeof(used)); int s; for (int i = 0; i < n; i++) { if (!used[i]) { s = i; used[s] = true; int t = order[s], c = 1; while (t != s) { used[t] = true; t = order[t]; c++; } vec.push_back(c); } } int l = vec.size(); ll res = 1; for (int i = 0; i < l; i++) { res = lcm(res, vec[i]); } return res; } void input() { cin >> n >> k; for (int i = 0; i < k; i++) { cin >> x[i] >> y[i]; x[i]--; y[i]--; } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); input(); cout << solve() << endl; }