Bearland has n cities, numbered 1 through n. There are m bidirectional roads. The i-th road connects two distinct cities ai and bi. No two roads connect the same pair of cities. It's possible to get from any city to any other city (using one or more roads).

The distance between cities a and b is defined as the minimum number of roads used to travel between a and b.

Limak is a grizzly bear. He is a criminal and your task is to catch him, or at least to try to catch him. You have only two days (today and tomorrow) and after that Limak is going to hide forever.

Your main weapon is BCD (Bear Criminal Detector). Where you are in some city, you can use BCD and it tells you the distance between you and a city where Limak currently is. Unfortunately, BCD can be used only once a day.

You don't know much about Limak's current location. You assume that he is in one of n cities, chosen uniformly at random (each city with probability <image>). You decided for the following plan:

  1. Choose one city and use BCD there. 
    * After using BCD you can try to catch Limak (but maybe it isn't a good idea). In this case you choose one city and check it. You win if Limak is there. Otherwise, Limak becomes more careful and you will never catch him (you loose). 
  2. Wait 24 hours to use BCD again. You know that Limak will change his location during that time. In detail, he will choose uniformly at random one of roads from his initial city, and he will use the chosen road, going to some other city. 
  3. Tomorrow, you will again choose one city and use BCD there. 
  4. Finally, you will try to catch Limak. You will choose one city and check it. You will win if Limak is there, and loose otherwise. 



Each time when you choose one of cities, you can choose any of n cities. Let's say it isn't a problem for you to quickly get somewhere.

What is the probability of finding Limak, if you behave optimally?

Input

The first line of the input contains two integers n and m (2 ≤ n ≤ 400, <image>) — the number of cities and the number of roads, respectively.

Then, m lines follow. The i-th of them contains two integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi) — cities connected by the i-th road.

No two roads connect the same pair of cities. It's possible to get from any city to any other city.

Output

Print one real number — the probability of finding Limak, if you behave optimally. Your answer will be considered correct if its absolute error does not exceed 10 - 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct if |a - b| ≤ 10 - 6.

Examples

Input

3 3
1 2
1 3
2 3


Output

0.833333333333


Input

5 4
1 2
3 1
5 1
1 4


Output

1.000000000000


Input

4 4
1 2
1 3
2 3
1 4


Output

0.916666666667


Input

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


Output

0.900000000000

Note

In the first sample test, there are three cities and there is a road between every pair of cities. Let's analyze one of optimal scenarios.

  1. Use BCD in city 1. 
    * With probability <image> Limak is in this city and BCD tells you that the distance is 0. You should try to catch him now and you win for sure. 
    * With probability <image> the distance is 1 because Limak is in city 2 or city 3. In this case you should wait for the second day. 
  2. You wait and Limak moves to some other city. 
    * There is probability <image> that Limak was in city 2 and then went to city 3. 
    * <image> that he went from 2 to 1. 
    * <image> that he went from 3 to 2. 
    * <image> that he went from 3 to 1. 
  3. Use BCD again in city 1 (though it's allowed to use it in some other city). 
    * If the distance is 0 then you're sure Limak is in this city (you win). 
    * If the distance is 1 then Limak is in city 2 or city 3. Then you should guess that he is in city 2 (guessing city 3 would be fine too). 



You loose only if Limak was in city 2 first and then he moved to city 3. The probability of loosing is <image>. The answer is <image>.
#include <bits/stdc++.h>
using namespace std;
const int N = 404, Inf = 1000000;
int n, m, a[N][N] = {}, d[N] = {};
void init() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) a[i][j] = (i != j) * Inf;
  for (int i = 1, u, v; i <= m; ++i) {
    scanf("%d%d", &u, &v);
    ++d[u], ++d[v];
    a[u][v] = a[v][u] = 1;
  }
  for (int k = 1; k <= n; ++k)
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j) a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
void work() {
  double ans = 0.0, e = 1.0 / n;
  for (int s1 = 1; s1 <= n; ++s1) {
    double sum = 0;
    for (int dis = 0; dis < n; ++dis) {
      bool in[N] = {};
      double p[N] = {}, sp[N] = {};
      int now[N] = {}, tot = 0, t2 = 0;
      for (int i = 1; i <= n; ++i)
        if (a[s1][i] == dis) {
          ++t2;
          for (int j = 1; j <= n; ++j)
            if (a[i][j] == 1) {
              in[j] = true;
              p[j] += e / d[i];
            }
        }
      if (t2 == 0) continue;
      for (int i = 1; i <= n; ++i)
        if (in[i]) now[++tot] = i;
      double tmp = e;
      for (int s2 = 1; s2 <= n; ++s2) {
        double ts = 0;
        for (int i = 1; i <= tot; ++i)
          sp[a[s2][now[i]]] = max(sp[a[s2][now[i]]], p[now[i]]);
        for (int i = 1; i <= tot; ++i)
          ts += sp[a[s2][now[i]]], sp[a[s2][now[i]]] = 0;
        tmp = max(tmp, ts);
      }
      sum += tmp;
    }
    ans = max(ans, sum);
  }
  printf("%.12f\n", ans);
}
int main() {
  init();
  work();
}
