#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
const int N = 1e5;
vi v[N];
vi pre;
void precompute(const string& pat) {
  int m = int((pat).size()), p = -1;
  pre = vi(m + 1);
  pre[0] = -1;
  for (int i = int(1); i < int(m + 1); i++) {
    while (p != -1 && pat[p] != pat[i - 1]) p = pre[p];
    p++;
    pre[i] = p;
  }
}
vi match(const string& s, const string& pat) {
  vi res;
  int n = int((s).size()), m = int((pat).size()), p = 0;
  for (int i = int(0); i < int(n); i++) {
    while (p != -1 && pat[p] != s[i]) p = pre[p];
    p++;
    if (p == m) {
      res.emplace_back(i - m + 1);
      p = pre[p];
    }
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  while (m--) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    if (a > b) swap(a, b);
    v[a].emplace_back(b);
    v[b].emplace_back(n + a);
  }
  string p;
  for (int a = int(0); a < int(n); a++) {
    sort(v[a].begin(), v[a].end());
    for (int b : v[a]) p += to_string(b - a);
    p += to_string(-1);
  }
  string s = p + p;
  precompute(p);
  cout << (int((match(s, p)).size()) > 2 ? "Yes" : "No") << '\n';
  return 0;
}
