#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
long long MOD = 1e9 + 7;
int l[200005], r[200005];
int n, m;
map<pair<int, int>, int> M;
vector<int> vec[200005];
int solve(int mod, int len) {
  set<int> s;
  for (int i = 0; i < vec[len].size(); i++) {
    s.insert(vec[len][i]);
  }
  while (!s.empty()) {
    int ind = (*s.begin());
    int st = ind;
    s.erase(st);
    for (int i = ind + mod;; i += mod) {
      if (i > n) i -= n;
      if (i == st) break;
      if (s.count(i) == 0) return 0;
      s.erase(i);
    }
  }
  return 1;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d%d", &l[i], &r[i]);
    x = l[i], y = r[i];
    if (y < x) swap(x, y);
    int l1 = (y - x), l2 = n - (y - x);
    if (l1 == l2) {
      vec[l1].push_back(x);
      vec[l1].push_back(y);
    } else if (l1 < l2) {
      vec[l1].push_back(x);
    } else {
      vec[l2].push_back(y);
    }
  }
  for (int i = n - 1; i >= 1; i--) {
    if (n % i) continue;
    int bol = 1;
    for (int j = 1; bol && j <= n / 2; j++) {
      if (solve(i, j))
        continue;
      else
        bol = 0;
    }
    if (bol) {
      cout << "Yes";
      return 0;
    }
  }
  cout << "No";
}
