#include <bits/stdc++.h>
using namespace std;
const long long N = 200001;
long long n, m, t;
map<pair<long long, long long>, long long> h;
vector<long long> v;
vector<pair<long long, long long> > s;
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    pair<long long, long long> p, d;
    p.first = a;
    p.second = b;
    d.first = b;
    d.second = a;
    s.push_back(p);
    h[p] = 1;
    h[d] = 1;
  }
  for (int i = 1; i < n; i++) {
    if (n % i == 0) v.push_back(i);
  }
  long long x = 0;
  for (int i = 0; i < v.size(); i++) {
    t = 0;
    for (int j = 0; j < m; j++) {
      long long a, b;
      a = s[j].first;
      b = s[j].second;
      pair<long long, long long> c;
      c.first = (a + v[i]) % n;
      c.second = (b + v[i]) % n;
      if (c.first == 0) c.first = n;
      if (c.second == 0) c.second = n;
      if (h[c] == 0) {
        t = 1;
        break;
      }
    }
    if (t == 0) {
      x = 1;
      break;
    }
  }
  if (x == 1)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
