#include <bits/stdc++.h>
#define NMAX 50001
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
int drg[NMAX];//dgr[i]=gradul interior al varfului i
queue<int>q;
vector<int>rez;
vector<int>G[NMAX];

void citire();
void sortaretop();
int main()
{
    int i;
    citire();
    sortaretop();
    for(i=0;i<rez.size();i++)
        fout<<rez[i]<<' ';
    return 0;
}
void citire()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        drg[y]++; G[x].push_back(y);
    }
}
void sortaretop()
{
    int x,i;
    for(x=1;x<=n;x++)
        if(drg[x]==0) q.push(x);
    while(!q.empty())
    {
        x=q.front(); q.pop();
        rez.push_back(x);
        for(i=0;i<G[x].size();i++)
        {
            drg[G[x][i]]--;
            if(drg[G[x][i]]==0) q.push(G[x][i]);
        }
    }
}