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

int n,m;
vector<int>g[50001];
bitset<50001>viz;
stack<int>sortat;

void citire()
{
    scanf("%d %d",&n,&m);
    while(m--)
    {
        int x,y;
        scanf("%d %d ",&x,&y);
        g[x].push_back(y);
    }
}

void dfs(int i)
{
    viz[i]=1;
    int nrv=g[i].size();
    for(int j=0;j<nrv;j++)
        if(viz[g[i][j]]==0)
            dfs(g[i][j]);
    sortat.push(i);
}

void sortare()
{
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            dfs(i);
    while(!sortat.empty())
    {
        printf("%d ",sortat.top());
        sortat.pop();
    }
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    sortare();
    return 0;
}