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

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

vector<int> q;
vector <int> s[50001];
int nrp[50001];
bool viz[500001];

void dfs(int x)
{
    viz[x]=1;
    for(auto y:s[x])
    {
        if(!viz[y])
        {
            dfs(y);
        }
    }
    q.push_back(x);
}
int main()
{int n,m;
    in>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        in>>x>>y;
        s[x].push_back(y);

    }
    for(int i=1; i<=n; i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
        }
    }
    for(int i=n-1;i>=0;i--)
    {
        out<<q[i]<<" ";
    }
    return 0;
}