#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define MAX 100005
//solutie cu heapuri
using namespace std;

ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");

int g[MAX];
int n, m, x, y;
vector <int> v[MAX];
priority_queue <int> heap;

int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        v[x].push_back(y);
        g[y]++;
    }
    for(int i=1; i<=n; i++)
        if(g[i]==0)
            heap.push(-i);
    for(int i=1; i<=n; i++)
    {
        int poz=-heap.top();
        heap.pop();
        cout<<poz<<" ";
        for(int vecin : v[poz])
        {
            g[vecin]--;
            if(g[vecin]==0)
                heap.push(-vecin);
        }
    }
    return 0;
}