#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector<int>g[50001], v;

int n, x, y,m;
bool visited[50001];
void DFS(int node)
{
    visited[node]=true;
    for (size_t i = 0; i < g[node].size(); i++ )
        if (!visited[g[node][i]])
            DFS(g[node][i]);
    v.push_back(node);
}
int main()
{
    fin >> n >> m;
    for ( int i = 1; i <= m; i++ )
    {
        fin >> x >> y;
        g[x].push_back(y);
    }
    for ( int i = 1; i <= n; i++ )
        if ( !visited[i] )
            DFS(i);
    for ( vector<int>::iterator it = v.end()-1; it >= v.begin(); --it )
    {
        fout << *it << ' ';
    }
    fin.close();
    fout.close();
    return 0;
}