1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>

#define mp make_pair
#define fi first
#define se second

using namespace std;

const int N = 200001;
const int M = 500001;
vector<int>v[N];
long long res;
vector<pair<int, int> > removed_edges;
pair<int, int> edges[M];
int n, m, a, b;
map<pair<int, int>, int > edges_num;

int low[N];
int disc[N];
int parent[N];
int dtime;
int bridges;

void preorder(int a) {
  int removed1 = -1;
  int removed2 = -1;
  disc[a] = dtime++;
  low[a] = a;
  if (removed_edges[0].fi == a) {
    removed1 = removed_edges[0].se;
  }
  if (removed_edges[1].fi == a) {
    removed2 = removed_edges[1].se;
  }
  if (removed_edges[0].se == a) {
    removed1 = removed_edges[0].fi;
  }
  if (removed_edges[1].se == a) {
    removed2 = removed_edges[1].fi;
  }
  for (int i = 0; i < v[a].size(); i++) {
    int b = v[a][i];
    if (removed1 == b) {
      removed1 = -1;
    } else if (removed2 == b) {
      removed2 = -1;
    } else {
      if (disc[b] == N) {
        parent[b] = a;
        preorder(b);
        if (low[b] == b) {
          // cout << "     low[" << b + 1 << "] == " << low[b] + 1  << endl;
          pair<int, int> edge = mp(min(a, b), max(a, b));
          int edge_num = edges_num[edge];
          if (removed_edges[0] == edge) {
            edge_num--;
          }
          if (removed_edges[1] == edge) {
            edge_num--;
          }
          if (edge_num == 1) {
            bridges++;
          }
        }
      }
      if (parent[a] != b && disc[low[b]] < disc[low[a]]) {
        low[a] = low[b];
      }
    }
  }
}

int getBridgesNum() {
  bridges = 0;
  dtime = 1;
  fill(disc, disc + n, N);
  fill(parent, parent + n, -1);
  for (int i = 0; i < n; i++) {
    low[i] = i;
  }
  preorder(0);
  return bridges;
}

bool destroyed() {
  bool visited[n];
  fill(visited, visited + n, false);
  queue<int> q;
  int visited_num = 1;
  visited[0] = 1;
  q.push(0);
  while(!q.empty()) {
    a = q.front();
    q.pop();
    int removed1 = -1;
    int removed2 = -1;
    if (removed_edges[0].fi == a) {
      removed1 = removed_edges[0].se;
    }
    if (removed_edges[1].fi == a) {
      removed2 = removed_edges[1].se;
    }
    if (removed_edges[0].se == a) {
      removed1 = removed_edges[0].fi;
    }
    if (removed_edges[1].se == a) {
      removed2 = removed_edges[1].fi;
    }
    for (int i = 0; i < v[a].size(); i++) {
      int b = v[a][i];
      if (!visited[b]) {
        if (removed1 == b) {
          removed1 = -1;
        } else if (removed2 == b) {
          removed2 = -1;
        } else {
          visited[b] = true;
          visited_num++;
          q.push(b);
        }
      }
    }
  }
  return visited_num != n;
}

int main() {
  ios_base::sync_with_stdio(0);

  cin >> n >> m;

  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    a--;
    b--;
    if (a > b) {swap(a, b);}
    v[a].push_back(b);
    v[b].push_back(a);
    edges[i] = mp(a, b);
    edges_num[edges[i]]++;
  }

  for (int i = 0; i < m; i++) {
    removed_edges.push_back(edges[i]);
    for (int j = 0; j < m; j++) {
      if (i != j) {
        removed_edges.push_back(edges[j]);
        if (destroyed()) {
          res += m - 2;
        } else {
          res += getBridgesNum();
        }
        removed_edges.pop_back();
      }
    }
    removed_edges.pop_back();
  }
  cout << res / 6 << endl;

  return 0;
}