#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

int viz[50001],n,m;

vector <int> Graph[100001];
stack <int> Stack;

void DFS(int node)
{
    viz[node] = 1;
    for(int i=0;i<Graph[node].size();i++)
    {
        int nn = Graph[node][i];
        if(viz[nn] == 0)
            DFS(nn);
    }
    Stack.push(node);
}

int main()
{
    int x1, x2;
    f >> n >> m;
    for(int i=0;i<m;i++)
    {
        f >> x1 >> x2;
        Graph[x1].push_back(x2);
    }
    for(int i=1;i<=n;i++)
    {
        if(viz[i] == 0)
            DFS(i);
    }

    for(int i=0;i<n;i++)
    {
        g << Stack.top() << ' ';
        Stack.pop();
    }
    return 0;
}