# include <cstdio>
# include <vector>
# include <queue>

using namespace std;

FILE *f = freopen("sortaret.in", "r", stdin);
FILE *g = freopen("sortaret.out", "w", stdout);

const int N_MAX = 50001;

int n, m;
int grad[N_MAX];

vector <int> G[N_MAX];
queue <int> q;

void read()
{
    scanf("%d %d", &n, &m);

    for (int i=1; i<=m; i++)
    {
        int x, y;
        scanf("%d %d", &x, &y);

        G[x].push_back(y);
        grad[y] ++;
    }
}

void solve()
{
    for (int i=1; i<=n; i++)
        if (grad[i] == 0)
            q.push(i);

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();

        printf("%d ", nod);

        for (vector <int> :: iterator it = G[nod].begin(); it != G[nod].end(); it++)
        {
            grad[*it]--;
            if (grad[*it] == 0)
                q.push(*it);
        }
    }
}

int main()
{
    read();
    solve();
    return 0;
}