#include<bits/stdc++.h>
using namespace std;
const int NMax = 50001;

stack<int>Stack;
vector<int> graph[NMax];
int vis[NMax];

void dfs(int nod)
{
    vis[nod] = 1;
    for(int i = 0; i < graph.size(); i++)
    {
        if(vis[i]) continue;
        else dfs(i);
    }
    Stack.push_back(nod);
}

int main()
{
    int n, m, x, y;
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    fin>>n >> m;
    for(int i = 1; i <= m ; i++)
    {
        fin>>x>>y;
        graph[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(vis[i]) continue;
        else dfs(i);
    }
    while(!Stack.empty())
    {
        fout<<Stack.top<<' ';
        Stack.pop();
    }
    return 0;
}