#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");

int n, m;
vector <int> v[50005];
int viz[50005];
stack<int> sk;

void sortare_topologica(int x)
{
    viz[x]=1;
    for(int i=0; i<v[x].size(); i++)
    {
        if(viz[v[x][i]]==0)
            sortare_topologica(v[x][i]);
    }
    sk.push(x);
}


int main()
{
    f>>n>>m;
    for(int i=0; i<m; i++)
    {
        int x, y;
        f>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    {
        if(viz[i]==0)
            sortare_topologica(i);
    }
    while(!sk.empty())
    {
        int p=sk.top();
        cout<<p<<" ";
        sk.pop();
    }
    return 0;
}