#include <bits/stdc++.h>
using namespace std;
int n , m;
vector<int> E[100005];
vector<int> to[100005];
int col[100005];
void dfs(int u,int c) {
    col[u] = c;
    for(auto v : to[u]) dfs(v , c);
}
typedef long long ll;
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    while(cin >> n >> m) {
        for(int i = 1;i <= n;i++) E[i].clear() , to[i].clear() , col[i] = 0;
        for(int i = 1;i <= m;i++) {
            int u , v;cin >> u >> v;
            E[u].push_back(v) ;
            E[v].push_back(u);
        }
        for(int i = 1;i <= n;i++) col[i] = i;
        for(int T = 1;T <= 5;T++) {
            for(int i = 1;i <= n;i++) {
                for(auto v : E[i]) col[v] = col[i] ;
            }
        }

        vector<ll> a(n + 1) , b(n + 1) , t(n + 1);
        for(int i = 1;i <= n;i++) {
            t[i] = 1 , a[col[i]]++ ;
            // printf("%d %d\n",i,col[i]);
        }
        auto upd = [&](int u,int v,int i)-> void {
            b[u] += 1LL * a[u] * (i - t[u]) ;
            t[u] = i;
            a[u] += v;
        };
        for(int i = 1;i <= n;i++) {
            for(auto v : E[i]) {
                upd(col[v] , -1 , i);
                upd(col[i] , 1 , i);
                col[v] = col[i];
            }
        }
        for(int i = 1;i <= n;i++) b[i] += 1LL * a[i] * (n + 1 - t[i]);
        sort(b.begin() + 1 , b.end()) ;
        for(int i = n;i >= 1;i--) {
            if(b[i] == 0) break ;
            // cout << b[i] << '\n';
            cout << fixed << setprecision(6) << (double)b[i] / n << '\n';
        }
        // break ;
    }
}