#include <bits/stdc++.h>
using namespace std;
int n , m;
vector<int> E[100005];
int fa[100005];
int col[100005];

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() , fa[i] = 0 , 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);
        }
        vector<ll> contri(n + 1);
        vector<int> mn(n + 1);
        for(int i = 1;i <= n;i++) {
            sort(E[i].begin() , E[i].end()) ;
            if(!E[i].size()) continue ;
            E[i].erase(unique(E[i].begin() , E[i].end()) , E[i].end()) ;
            for(int j = 0;j < E[i].size();j++) {
                if(E[i][j] == i) {
                    E[i].erase(E[i].begin() + j) ; break ;
                }
            }
            if(E[i][0] < i) {
                auto it = lower_bound(E[i].begin() , E[i].end() , i);
                it-- ;
                fa[i] = (*it);
            }
            else {
                auto it = E[i].end() ;
                it-- ;
                fa[i] = (*it) ;
                mn[i] = 1;
            }
        }
        
        vector<double> ans ;
        for(int i = 1;i <= n;i++) {
            // printf("%d %d\n",i,fa[i]);
            if(!E[i].size()) {
                ans.push_back(1.0); continue ;
            }
            for(int j = 0 ; j < E[i].size();j++) {
                if(j < E[i].size() - 1) contri[E[i][j]] += (E[i][j + 1] - E[i][j]) ;
                else contri[E[i][j]] += (E[i][0] + n - E[i][j]) ;
            }
        }

        vector<int> vis(n + 1) , to(n + 1);
        int cc = 0;
        map<int , vector<int> > mp;
        vector<ll> val(n + 1);

        for(int i = 1;i <= n;i++) {
            if(vis[i]) continue ;
            int u = i;
            vector<int> cl;
            while(!vis[u]) {
                vis[u] = i;
                cl.push_back(u);
                u = fa[u] ;
            }
            if(vis[u] != i) {
                for(auto x : cl) to[x] = to[u] ;
            }
            else {
                ++cc ;
                for(auto x : cl) to[x] = cc;
                int v = fa[u];
                if(mn[u]) mp[cc].push_back(u);
                // printf("%d %d\n",u,mn[u]);
                while(v != u) {
                    if(mn[v]) mp[cc].push_back(v) ;
                    // printf("%d %d\n",v,mn[v]);
                    v = fa[v];
                }
            }
        }
        for(int i = 1;i <= n;i++) {
            val[to[i]] += contri[i];
            // printf("%d %d : %d\n",i,contri[i] , to[i]) ;
        }
        // printf("MPS %d : %d\n",mp.size() , cc);
        for(auto &[x,y] : mp) {
            // printf("%d : %d\n",x,y.size()) ;
            for(auto z : y) ans.push_back((double)val[x] / n / y.size()) ;
        }

        sort(ans.begin() , ans.end()) ;
        for(int i = ans.size() - 1;i >= 0;i--) {
            cout << fixed << setprecision(6) << ans[i] << '\n';
        }
        // break ;
    }
}