// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

struct graph {
    struct node {
        int u, v, w;
    };
    vector<vector<node>> e;
    int n, m;
    bool directed;
    vector<int> un;
    vector<int> dis0, disn;
    graph(int V, bool D = 0) {
        n = V;
        e.resize(n);
        dis0.resize(n);
        disn.resize(n);
        directed = D;
    }
    void add_edge(int u, int v, int w = 1) {
        e[u].push_back(node{u, v, w});
        ++m;
    }
    void graphviz_dump(string filename = "graph.dot") {
        ofstream gf;
        gf.open(filename);
        gf << (directed ? "digraph" : "graph") << " {\n";
        gf << "    "; rep(i, 0, n) gf << i << " ;"[i==n-1]; gf << endl;
        string notation = directed ? " -> " : " -- ";
        for (auto es: e) {
            for (auto edge: es) {
                gf << "    " << edge.u << notation << edge.v << (directed ? " ;\n" : ";\n");
            }
        }
        gf << "}\n";
    }

    int min0, minn;
    void bfs(vector<int> &dis, int s, int &minv) {
        fill(dis.begin(), dis.end(), INF);
        queue<pair<int, int>> q;
        dis[s] = 0;
        q.push({s, 0});
        while (!q.empty()) {
            auto [u, d] = q.front(); q.pop();
            for (auto ed: e[u]) {
                if (dis[ed.v] != INF) continue;
                dis[ed.v] = d + 1;
                q.push({ed.v, d + 1});
            }
        }
        minv = INF;
        for (int i: un) minv = min(minv, dis[i]);
    }
};

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n, m; cin >> n >> m;
    graph g(n);
    int x = 0;
    rep(i, 0, m) {
        int u, v; cin >> u >> v;
        if (u && v) g.add_edge(u-1, v-1), g.add_edge(v-1, u-1);
        else g.un.push_back(u ? u-1 : v-1);
    }
    bool link0 = find(g.un.begin(), g.un.end(), 0) != g.un.end();
    bool linkn = find(g.un.begin(), g.un.end(), n-1) != g.un.end();
    // g.graphviz_dump();
    g.bfs(g.dis0, 0, g.min0);
    g.bfs(g.disn, n-1, g.minn);
    rep(i, 0, n) {
        int ans = min({g.dis0[n-1], g.min0 + g.disn[i] + 1, g.minn + g.dis0[i] + 1});
        if (link0 && linkn) ans = min(ans, (int)2);
        cout << (ans>=INF ? -1 : ans) << " \n"[i==n-1];
    }

    return 0;
}