#include<fstream>
#include<stack>
#include<vector>
using namespace std;


ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,P[50001];
vector<vector<int>>G(200001),GT(200001);
stack<int>S;

void DFS(int nod)
{
    P[nod]=1;
    for(auto x:G[nod])
        if(!P[x])
            DFS(x);
    S.push(nod);
}


int main()
{
    cin>>n>>m;

    for(int i=1,x,y;i<=m;++i)
    {
        cin>>x>>y;
        G[x].push_back(y);
        GT[y].push_back(x);
    }
    for(int i=1;i<=n;++i)
        if(!P[i])
            DFS(i);
    while(!S.empty())
    {
        cout<<S.top()<<" ";
        S.pop();

    }

}