#include <bits/stdc++.h>

using namespace std;

constexpr int N = 2e5;

vector<int> nei[N];
int rad[N], d[N], sz[N], par[N];
uint64_t dpd[N], dpdd[N], dpu[N], dpuu[N];

int calcd(int v, int p, int cd) {
  par[v] = p;
  int f = v; d[v] = 0, sz[v] = 1;
  for (auto u: nei[v]) if (u != p) {
    int fu = calcd(u, v, cd + 1);
    sz[v] += sz[u];
    if (d[v] < d[u] + 1) d[v] = d[u] + 1, f = fu;
  }
  rad[v] = max(rad[v], cd);
  return f;
}

void solved(int v, int p) {
  int c = 0;
  uint64_t cdpd = 1, cdpdd = 1, mn = 1e18;
  for (auto u: nei[v]) if (u != p) {
    solved(u, v);
    cdpd += dpd[u] + dpdd[u];
    cdpdd += dpdd[u] * 2;
    mn = min(mn, dpdd[u]);
    ++c;
  }
  if (c > 1) cdpd += mn;
  dpd[v] = cdpd;
  dpdd[v] = cdpdd;
}

void solveu(int v, int p) {
  uint64_t a = 0, b = 0, c = 0, sdpd = 0, sdpdd = 0;
  for (auto u: nei[v]) {
    auto cur = u == p? dpuu[v]: dpdd[u];
    cur > a? c = b, b = a, a = cur:
    cur > b? c = b, b = cur:
    cur > c? c = cur: 0;
    if (u != p) sdpd += dpd[u], sdpdd += dpdd[u];
    else sdpdd += dpuu[v];
  }
  for (auto u: nei[v]) if (u != p) {
    dpuu[u] = (sdpdd - dpdd[u]) * 2 + 1;
    dpu[u] = dpu[v] + sdpd - dpd[u] + sdpdd - dpdd[u] + (dpdd[u] == c? b: c) + 1;
    solveu(u, v);
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m, r; cin >> n >> m;
  for (int i = 0, a, b; i < m; ++i) cin >> a >> b, --a, --b, nei[a].push_back(b), nei[b].push_back(a);
  bool ok = 1;
  for (int i = 0; i < n; ++i) ok &= nei[i].size() < 4;
  if (!ok || m > n - 1 || (r = calcd(0, 0, 0), r = calcd(r, r, 0), calcd(r, r, 0), d[r] > 64)) return cout << "NIE\n", 0;
  solved(r, r);
  solveu(r, r);
  uint64_t ans = 1e18;
  for (int i = 0; i < n; ++i) if (rad[i] <= 32) {
    vector<int> nls;
    int ls = -1;
    for (auto u: nei[i]) !~ls && nei[u].size() == 1? ls = u, void(): nls.push_back(u);
    if (nls.size() > 2) continue;
    uint64_t cans = 0, a = 0, b = 0;
    for (auto u: nls) {
      if (u == par[i]) {
        cans += dpu[i] + dpuu[i];
        dpuu[i] > a? b = a, a = dpuu[i]:
        dpuu[i] > b? b = dpuu[i]: 0;
      } else {
        cans += dpd[u] + dpdd[u];
        dpdd[u] > a? b = a, a = dpdd[u]:
        dpdd[u] > b? b = dpdd[u]: 0;
      }
    }
//    cout << i << ' ' << cans + b + 1 << '\n';
    ans = min(ans, cans + b + 1);
  }
  if (ans == 1e18) return cout << "NIE\n", 0;
  cout << ans;
}