#include<cstdio>
#include<vector>
#include<bitset>
using namespace std;
const int NMAX = 50005;
int n,m,i,j,x,y,sol[NMAX],N;
vector<int> V[NMAX];
bitset<NMAX> viz;
void Read()
{
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        V[x].push_back(y);
    }
}
void DFS(int x)
{
    viz[x]=1;
    for(vector<int>::iterator it=V[x].begin();it!=V[x].end();it++)
        if(!viz[*it]) DFS(*it);
    sol[++N]=x;
}
void Topological_Sort()
{
    for(i=1;i<=n;i++)
        if(!viz[i]) DFS(i);
}
void Print()
{
    for(i=N;i;i--) printf("%d ",sol[i]);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    Read();
    Topological_Sort();
    Print();
    return 0;
}