#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> L[100001];
int grad[100001];
int main()
{
    int n,m;
    fin>>n>>m;
    for (int i=1; i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        grad[y]++;
        L[x].push_back(y);
    }
    queue<int> q;
    for (int i=1;i<=n;i++)
        if (grad[i]==0)
            q.push(i);
    while (!q.empty())
    {
        int x=q.front();
        q.pop();
        fout<<x<<" ";
        for (auto vec : L[x])
        {
            grad[vec]--;
            if (grad[vec]==0)
                q.push(vec);
        }
    }
    return 0;
}