#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
template <class T>
inline T bigMod(T p, T e, T M) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
  return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T>
inline string int2String(T a) {
  ostringstream str;
  str << a;
  return str.str();
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
const int maxn = 1e5 + 5;
vector<int> v[maxn];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int x, y;
  for (int i = int(0); i < int(m); i++) {
    scanf("%d%d", &x, &y);
    v[x].push_back((x - y + n) % n);
    v[y].push_back((y - x + n) % n);
  }
  if (n == 2) {
    puts("Yes");
    return 0;
  }
  for (int i = int(1); i < int(n + 1); i++) sort(v[i].begin(), v[i].end());
  for (int k = 2; k * k <= n; k++) {
    if (n % k) continue;
    ;
    bool possible = 1;
    for (int i = int(1); i < int(n + 1); i++) {
      if (v[i] != v[1 + (i + k - 1 + n) % n]) {
        possible = 0;
        break;
      }
    }
    if (possible) {
      puts("Yes");
      return 0;
    }
    possible = 1;
    for (int i = int(1); i < int(n + 1); i++) {
      if (v[i] != v[1 + (i + n / k - 1 + n) % n]) {
        possible = 0;
        break;
      }
    }
    if (possible) {
      puts("Yes");
      return 0;
    }
  }
  puts("No");
  return 0;
}
