#include <bits/stdc++.h>
using namespace std;
void open(const char *s) {}
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
const int Minf = 0x7f7f7f7f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const long long MINF = 0x7f7f7f7f7f7f7f7fll;
const int N = 1e5 + 50;
int p[2] = {123321, 432344};
int q[2] = {1232123, 235432};
unsigned int Hash[2][N * 2];
unsigned int pw[2][N * 2];
unsigned int get(int l, int r, int id) {
  return Hash[id][r] - Hash[id][l - 1] * pw[id][r - l + 1];
}
int main() {
  int n, m, x, y;
  scanf("%d%d", &n, &m);
  vector<int> v[n + 1];
  for (int i = (1); i <= (m); ++i) {
    scanf("%d%d", &x, &y);
    v[x].push_back(y - x < 0 ? y - x + n : y - x);
    v[y].push_back(x - y < 0 ? x - y + n : x - y);
  }
  for (int i = (1); i <= (n); ++i) {
    sort(v[i].begin(), v[i].end());
    for (int j = (0); j <= (1); ++j)
      for (int k = (0); k < ((int)v[i].size()); ++k) {
        Hash[j][i] = (Hash[j][i] * p[j] ^ v[i][k]) * p[j] + v[i][k];
      }
  }
  for (int i = (0); i <= (1); ++i)
    for (int j = (1); j <= (n - 1); ++j) {
      Hash[i][j + n] = Hash[i][j];
    }
  pw[0][0] = pw[1][0] = 1;
  for (int i = (0); i <= (1); ++i)
    for (int j = (1); j <= (2 * n - 1); ++j) {
      Hash[i][j] = Hash[i][j - 1] * q[i] + Hash[i][j];
      pw[i][j] = pw[i][j - 1] * q[i];
    }
  unsigned int ans1 = Hash[0][n];
  unsigned int ans2 = Hash[1][n];
  for (int i = (2); i <= (n); ++i) {
    if (ans1 == get(i, i + n - 1, 0) && ans2 == get(i, i + n - 1, 1)) {
      puts("Yes");
      return 0;
    }
  }
  puts("No");
  return 0;
}
