#include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
using namespace std;

vector <int> g[50005];
int n, m;
stack <int> a;
bool v[50005];

void dfs(int nod)
{

    for(int i=0; i<g[nod].size(); i++)
        if(v[g[nod][i]]==0)
            dfs(g[nod][i]);

    v[nod]=1;
    a.push(nod);
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    cin>>n>>m;
    int x, y;

    for(int i=1; i<=m; i++)
    {
        scanf("%d %d", &x, &y);
        g[x].push_back(y);

    }

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

    while(!a.empty())
    {
        printf("%d ", a.top());
        a.pop();
    }

    return 0;
}