#include <iostream>
#include <set>
#include <algorithm>
#include <queue>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10, MAXM = 8e5 + 10;

int n, m;
struct Edge
{
    int u, v, w;
}g[MAXM];

vector <int> e[MAXN];
queue <int> q;
int deg[MAXN];
int idx[MAXN], topo[MAXN], clk;

int mnt[MAXN];
int pre[MAXN], suf[MAXN];
multiset <int> st;

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    for (int i = 1; i <= m; i++)
    {
        Read(g[i].u), Read(g[i].v), g[i].w = i;
        e[g[i].u].push_back(g[i].v), deg[g[i].v]++;
    }
    for (int i = 1; i <= n; i++)
        if (!deg[i]) q.push(i);
    while (!q.empty())
    {
        int u = q.front(); q.pop();
        idx[u] = ++clk, topo[clk] = u;
        for (auto v : e[u])
            if (!--deg[v]) q.push(v);
    }
    sort(g + 1, g + m + 1, [&](Edge x, Edge y) {return idx[x.v] < idx[y.v];});
    for (int i = 1; i <= n; i++) mnt[i] = 2e9;
    for (int i = 1, j = 1; i <= n; i++)
    {
        while (j <= m && g[j].v == topo[i])
        {
            if (mnt[g[j].u] > g[j].w)
            {
                st.erase(st.find(mnt[g[j].u]));
                mnt[g[j].u] = g[j].w;
                st.insert(g[j].w);
            }
            j++;
        }
        pre[topo[i]] = (st.size() ? *st.rbegin() : 0);
        st.insert(mnt[topo[i]]);
    }
    st.clear();
    sort(g + 1, g + m + 1, [&](Edge x, Edge y) {return idx[x.u] > idx[y.u];});
    for (int i = 1; i <= n; i++) mnt[i] = 2e9;
    for (int i = n, j = 1; i >= 1; i--)
    {
        while (j <= m && g[j].u == topo[i])
        {
            if (mnt[g[j].v] > g[j].w)
            {
                st.erase(st.find(mnt[g[j].v]));
                mnt[g[j].v] = g[j].w;
                st.insert(g[j].w);
            }
            j++;
        }
        suf[topo[i]] = (st.size() ? *st.rbegin() : 0);
        st.insert(mnt[topo[i]]);
    }
    for (int i = 1; i <= n; i++)
        if (pre[i] == 2e9 || suf[i] == 2e9) cout << "-1 ";
        else cout << max(pre[i], suf[i]) << ' ';
    cout << '\n';
    return 0;
}