#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  set<int> li[n];
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    int t = min(a, b);
    b = max(a, b);
    a = t;
    li[a].insert(b - a);
    li[b].insert(n + a - b);
  }
  int s = (n + 2 * m) * 2 - 1;
  int nee[s];
  int cc = 0;
  for (int i = 0; i < n; i++) {
    nee[cc] = 0;
    cc++;
    for (set<int>::iterator it = li[i].begin(); it != li[i].end(); it++, cc++) {
      nee[cc] = *it;
    }
  }
  for (int i = n + 2 * m; i < s; i++) nee[i] = nee[i - (n + 2 * m)];
  int kmp[s];
  kmp[0] = -1;
  bool fo = 0;
  for (int i = 1; i < s; i++) {
    int p1 = i - 1, p2 = kmp[p1];
    while (nee[i] != nee[p2 + 1] && p2 != -1) {
      p1 = p2;
      p2 = kmp[p2];
    }
    if (nee[i] == nee[p2 + 1])
      kmp[i] = kmp[p1] + 1;
    else
      kmp[i] = -1;
    if (kmp[i] == n + 2 * m - 1) {
      fo = 1;
      break;
    }
  }
  if (fo)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
