#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,x,y;
vector <int> v[50002];
stack <int> sol;
bool viz[50002];
void DFS(int x)
{
    viz[x]=1;
    vector<int> :: iterator i;
    for( i=v[x].begin();i!=v[x].end();++i)
        if(viz[*i]!=1)
            DFS(*i);
    sol.push(x);
}
void Read()
{
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    //for(int i=1;i<=50000;++i)
    // while(A[i].size()){fout<<i<<" "<<A[i].back()<<"\n";A[i].pop_back();}
    for(int i=1; i<=n; ++i)
        if(viz[i] == 0)
        {
            DFS(i);
        }
        //reverse(sol.begin(),sol.end());
    while(!sol.empty())
    {
        fout<<sol.top()<<" ";
        sol.pop();
    }
}
int main()
{
    Read();
    return 0;
}