#include <bits/stdc++.h>
const long long inf = 0x3f3f3f3f3f3f3f3LL;
const long long mod = (long long)1e9 + 7;
using namespace std;
template <class T, class T2>
void smin(T& a, T2 val) {
  if (a > val) a = val;
}
template <class T, class T2>
void smax(T& a, T2 val) {
  if (a < val) a = val;
}
const long long N = 5 * (long long)1e5 + 10;
long long n, m;
vector<long long> B[N];
vector<long long> A;
vector<long long> z_function(vector<long long>& s, long long n) {
  vector<long long> z(n);
  for (long long i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) {
      z[i] = min(r - i + 1, z[i - l]);
    }
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) {
      ++z[i];
    }
    if (i + z[i] - 1 > r) {
      l = i, r = i + z[i] - 1;
    }
  }
  return z;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  for (long long i = 0; i < m; ++i) {
    long long x, y;
    cin >> x >> y;
    if (x > y) {
      swap(x, y);
    }
    long long dist1 = y - x;
    B[x].push_back(dist1);
    long long dist2 = n - y + x;
    B[y].push_back(dist2);
  }
  for (long long i = 1; i <= n; ++i) {
    A.push_back(-1);
    sort(B[i].begin(), B[i].end());
    for (auto& it : B[i]) {
      A.push_back(it);
    }
  };
  long long len = (long long)(A.size());
  vector<long long> v = A;
  for (auto it : v) {
    A.push_back(it);
  }
  vector<long long> z = z_function(A, (long long)(A.size()));
  ;
  ;
  for (long long i = 1; i < len; ++i) {
    if (z[i] >= len) {
      cout << "Yes";
      exit(0);
    }
  }
  cout << "No";
  return 0;
}
