#include <bits/stdc++.h>
using namespace std;
unsigned long long min(unsigned long long x, unsigned long long y) {
  if (x < y) return x;
  return y;
}
unsigned long long max(unsigned long long x, unsigned long long y) {
  if (x < y) return y;
  return x;
}
long long min(long long x, long long y) {
  if (x < y) return x;
  return y;
}
long long max(long long x, long long y) {
  if (x < y) return y;
  return x;
}
double min(double x, double y) {
  if (x < y) return x;
  return y;
}
double max(double x, double y) {
  if (x < y) return y;
  return x;
}
unsigned long long gcd(unsigned long long x, unsigned long long y) {
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  return gcd(x, y % x);
}
unsigned long long inv(unsigned long long a, unsigned long long c) {
  if (a == 1) {
    return 1;
  }
  return ((c - (c / a)) * inv(c % a, c)) % c;
}
int n, m, a, b, lps[100005] = {0};
vector<vector<int> > str, sub(100005);
void fill() {
  int i = 1, j = 0;
  while (i < n) {
    if (sub[j] == sub[i]) {
      lps[i] = j + 1;
      i++;
      j++;
    } else {
      if (!j) {
        i++;
      } else {
        j = lps[j - 1];
      }
    }
  }
}
int kmp() {
  int N = str.size();
  int i = 0, j = 0;
  while ((i < N) && (j < n)) {
    if (str[i] == sub[j]) {
      i++;
      j++;
    } else {
      if (!j)
        i++;
      else
        j = lps[j - 1];
    }
  }
  if (j < n) return 0;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    if (a > b) swap(a, b);
    sub[a - 1].push_back(b - a);
    sub[b - 1].push_back(a - b + n);
  }
  for (int i = 0; i < n; i++) {
    sort(sub[i].begin(), sub[i].end());
  }
  for (int i = 1; i < n; i++) {
    str.push_back(sub[i]);
  }
  for (int i = 0; i < n - 1; i++) {
    str.push_back(sub[i]);
  }
  fill();
  if (kmp()) {
    cout << "Yes\n";
  } else {
    cout << "No\n";
  }
  return 0;
}
