#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> edges;
string answer;
void ReadInput() {
  cin >> n >> m;
  edges.resize(n + 1);
  int start, finish;
  for (size_t i = 0; i < m; i++) {
    cin >> start >> finish;
    edges[start].push_back(finish);
    edges[finish].push_back(start);
  }
}
void getZarr(string str, int Z[]);
bool search(string text, string pattern) {
  string concat = pattern + "$" + text;
  int l = concat.length();
  int Z[l];
  getZarr(concat, Z);
  for (int i = 0; i < l; ++i) {
    if (Z[i] == pattern.length()) return true;
  }
  return false;
}
void getZarr(string str, int Z[]) {
  int n = str.length();
  int L, R, k;
  L = R = 0;
  for (int i = 1; i < n; ++i) {
    if (i > R) {
      L = R = i;
      while (R < n && str[R - L] == str[R]) R++;
      Z[i] = R - L;
      R--;
    } else {
      k = i - L;
      if (Z[k] < R - i + 1)
        Z[i] = Z[k];
      else {
        L = i;
        while (R < n && str[R - L] == str[R]) R++;
        Z[i] = R - L;
        R--;
      }
    }
  }
}
string Solve() {
  for (size_t i = 1; i <= n; i++)
    for (size_t j = 0; j < edges[i].size(); j++)
      edges[i][j] = (edges[i][j] - i + n) % n;
  for (size_t i = 1; i <= n; i++) sort(edges[i].begin(), edges[i].end());
  string pattern;
  string text;
  for (size_t i = 1; i <= n; i++) {
    pattern += to_string(edges[i].size());
    pattern += ':';
    for (size_t j = 0; j < edges[i].size(); j++) {
      pattern += to_string(edges[i][j]);
      pattern += '#';
    }
    pattern += '!';
  }
  text = pattern + pattern;
  text.pop_back();
  text = text.substr(text.find("!") + 1);
  edges.clear();
  if (search(text, pattern)) return "Yes";
  return "No";
}
void WriteOutput() { cout << answer << endl; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ReadInput();
  answer = Solve();
  WriteOutput();
  return 0;
}
