You are given an undirected graph of N nodes and M edges, E_1, E_2, ... E_M.

A connected graph is a cactus if each of it's edges belogs to at most one simple cycle. A graph is a desert if each of it's connected components is a cactus. 

Find the number of pairs (L, R), (1 ≤ L ≤ R ≤ M) such that, if we delete all the edges except for E_L, E_{L+1}, ... E_R, the graph is a desert. 

Input

The first line contains two integers N and M (2 ≤ N ≤ 2.5 × 10^5, 1 ≤ M ≤ 5 × 10^5). Each of the next M lines contains two integers. The i-th line describes the i-th edge. It contains integers U_i and V_i, the nodes connected by the i-th edge (E_i=(U_i, V_i)). It is guaranteed that 1 ≤ U_i, V_i ≤ N and U_i ≠ V_i. 

Output

The output contains one integer number – the answer.

Examples

Input


5 6
1 2
2 3
3 4
4 5
5 1
2 4


Output


20

Input


2 3
1 2
1 2
1 2


Output


5

Note

In the second example: Graphs for pairs (1, 1), (2, 2) and (3, 3) are deserts because they don't have any cycles. Graphs for pairs (1, 2) and (2, 3) have one cycle of length 2 so they are deserts.
5 10
1 2
1 3
1 4
1 5
2 3
2 4
2 5
3 4
3 5
4 5
 4 5
1 2
2 3
2 4
3 4
4 1
 5 4
1 2
2 3
3 4
4 5
 3 6
1 2
2 3
3 1
1 2
2 3
3 1
 10 15
1 2
1 5
1 6
2 3
2 7
3 4
3 8
4 5
4 9
5 10
6 8
6 9
7 9
7 10
8 10
 8 11
1 2
2 3
2 4
3 4
4 1
5 6
6 8
6 7
7 8
7 5
8 5
 5 1
1 2
 5 8
1 2
2 3
3 1
2 5
3 4
4 5
5 3
1 4

38
 14
 10
 15
 99
 48
 1
 30

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
const int MAXM = 1e6 + 5;
namespace LCT {
struct Node {
  Node *fa;
  union {
    Node *son[2];
    struct {
      Node *ls, *rs;
    };
  };
  bool rev_tag;
  int vtag, val, mx;
  Node(void) {}
  Node(Node *emp, int _val)
      : fa(emp),
        ls(emp),
        rs(emp),
        rev_tag(0),
        vtag(-1),
        val(_val),
        mx(max(_val, 0)) {}
} *emp = new Node(emp, 0), *hd = 0;
inline Node *new_Node(int val) {
  if (!hd) {
    static const int SIZ = MAXN + MAXM;
    hd = new Node[SIZ + 1];
    for (int i = 0; i < SIZ; ++i) (hd + i)->rs = hd + i + 1;
    (hd + SIZ)->rs = 0;
  }
  Node *res = hd;
  hd = hd->rs;
  *res = Node(emp, val);
  return res;
}
inline bool is_root(Node *u) {
  return u->fa == emp || (u->fa->ls != u && u->fa->rs != u);
}
inline int get_ch(Node *u) { return u->fa->rs == u; }
inline void upd_rev(Node *u) {
  u->rev_tag ^= 1;
  swap(u->ls, u->rs);
}
inline void upd_v(Node *u, int k) {
  if (u != emp) {
    if (u->val != -1) u->val = k;
    u->vtag = u->mx = k;
  }
}
inline void push_up(Node *u) {
  u->mx = max(u->ls->mx, u->rs->mx);
  if (u->val != -1) u->mx = max(u->mx, u->val);
}
inline void push_down(Node *u) {
  if (u->rev_tag) {
    upd_rev(u->ls);
    upd_rev(u->rs);
    u->rev_tag = 0;
  }
  if (u->vtag != -1) {
    upd_v(u->ls, u->vtag);
    upd_v(u->rs, u->vtag);
    u->vtag = -1;
  }
}
inline void rotate(Node *u) {
  Node *v = u->fa, *w = v->fa;
  int k = get_ch(u);
  if (!is_root(v)) w->son[get_ch(v)] = u;
  v->son[k] = u->son[!k];
  u->son[!k]->fa = v;
  u->son[!k] = v;
  v->fa = u;
  u->fa = w;
  push_up(v);
  push_up(u);
}
inline void push_down_all(Node *u) {
  if (!is_root(u)) push_down_all(u->fa);
  push_down(u);
}
inline void splay(Node *u) {
  push_down_all(u);
  for (Node *v; v = u->fa, !is_root(u); rotate(u))
    if (!is_root(v)) rotate(get_ch(v) == get_ch(u) ? v : u);
}
inline Node *access(Node *u) {
  Node *pre = emp;
  for (; u != emp; pre = u, u = u->fa) splay(u), u->rs = pre, push_up(u);
  return pre;
}
inline void make_root(Node *u) { upd_rev(access(u)); }
inline Node *find(Node *u) {
  access(u);
  splay(u);
  push_down(u);
  while (u->ls != emp) u = u->ls, push_down(u);
  splay(u);
  return u;
}
inline void link(Node *u, Node *v) {
  make_root(u);
  splay(u);
  u->fa = v;
  push_up(v);
}
inline void cut(Node *u, Node *v) {
  make_root(u);
  access(v);
  splay(v);
  v->ls = u->fa = emp;
  push_up(v);
}
inline int query_mx(Node *u, Node *v) {
  make_root(u);
  access(v);
  splay(v);
  return v->mx;
}
inline void update_val(Node *u, Node *v, int k) {
  make_root(u);
  access(v);
  splay(v);
  upd_v(v, k);
}
}  // namespace LCT
using namespace LCT;
int a[MAXM], b[MAXM];
Node *pn[MAXN], *pe[MAXM];
bool del[MAXM];
inline void adde(int id) {
  int u = a[id], v = b[id];
  if (find(pn[u]) != find(pn[v])) {
    link(pe[id], pn[u]);
    link(pe[id], pn[v]);
    del[id] = 0;
  } else {
    update_val(pn[u], pn[v], id);
    del[id] = 1;
  }
}
inline void dele(int id) {
  int u = a[id], v = b[id];
  if (del[u])
    update_val(pn[u], pn[v], 0);
  else {
    int oth = query_mx(pn[u], pn[v]);
    if (oth > 0) {
      cut(pn[u], pe[id]);
      cut(pn[v], pe[id]);
      int uu = a[oth], vv = b[oth];
      link(pn[uu], pe[oth]);
      link(pn[vv], pe[oth]);
      del[oth] = 0;
      update_val(pn[u], pn[v], 0);
    } else {
      cut(pn[u], pe[id]);
      cut(pn[v], pe[id]);
    }
  }
}
int main(void) {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; ++i) scanf("%d%d", &a[i], &b[i]);
  for (int i = 1; i <= n; ++i) pn[i] = new_Node(-1);
  for (int i = 1; i <= m; ++i) pe[i] = new_Node(0);
  long long ans = 0;
  for (int r = 1, l = 1; r <= m; ++r) {
    int u = a[r], v = b[r];
    while (l < r && find(pn[u]) == find(pn[v]) && query_mx(pn[u], pn[v]) > 0)
      dele(l++);
    adde(r);
    ans += r - l + 1;
  }
  printf("%lld", ans);
  return 0;
}
