#include <cstdio>
#include <vector>
#include <stack>
using namespace std;

struct nod
{
    int x;
    int y;
};
int n,m;
int viz[100005];
vector < int > graph[50000 * 2 +5];
stack <int> afisQueue;
void citire()
{
    scanf("%d %d",&n,&m);
    for(int i = 0 ; i < m;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        graph[x].push_back(y);
    }

}

void dfs(int i)
{

    viz[i] = 1;
    for(int j = 0 ; j < graph[i].size();j++)
    if(viz[graph[i][j]] == 0)
    {
        int v = graph[i][j];
        dfs(v);
    }
    afisQueue.push(i);
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    for(int i = 1 ; i <= n;i++)
    {
        if(viz[i] == 0)
        dfs(i);
    }
    while(!afisQueue.empty())
    {
        printf("%d ",afisQueue.top());
        afisQueue.pop();
    }
    return 0;
}