#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int n,m,f[50100],x,y;
vector<int>v[50100];
stack<int>S;
void dfs (int x)
{
    int i;
    f[x]=1;
    for (auto i:v[x])
    if (f[i]==0) dfs(i);

    S.push(x);
}

int main()
{
    cin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        cin>>x>>y;
        v[x].push_back(y);
    }

    for (int i=1; i<=n; i++)
    if (f[i]==0) dfs(i);

    while (!S.empty()) {cout<<S.top()<<" "; S.pop();}

    return 0;
}