#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const long long int N = 100005;
vector<long long int> gived(long long int n) {
  vector<long long int> v;
  for (long long int i = 1; i < n; i++) {
    if (n % i == 0) {
      v.push_back(i);
    }
  }
  return v;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    long long int i, j, k, n, m, ans = 0, cnt = 0, sum = 0;
    cin >> n >> m;
    vector<pair<long long int, long long int> > a(m), vv(m);
    set<pair<long long int, long long int> > St;
    for (i = 0; i < m; i++) {
      cin >> a[i].first >> a[i].second;
      a[i].first--;
      a[i].second--;
      if (a[i].first > a[i].second) {
        swap(a[i].first, a[i].second);
      }
      vv[i] = {a[i].first, a[i].second};
    }
    vector<long long int> v = gived(n);
    sort(vv.begin(), vv.end());
    for (auto x : v) {
      for (i = 0; i < m; i++) {
        pair<long long int, long long int> p = {
            min((a[i].first + x) % n, (a[i].second + x) % n),
            max((a[i].first + x) % n, (a[i].second + x) % n)};
        bool bl = binary_search(vv.begin(), vv.end(), p);
        if (!bl) {
          break;
        }
      }
      if (i == m) {
        cout << "Yes";
        return 0;
      }
    }
    cout << "No";
  }
}
