#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

#define NMAX 50005

int N,M;
int Grade[NMAX];
bool used[NMAX];

vector < int > G[NMAX], TSL;

void Read()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d%d",&N,&M);

    int x,y;
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
        Grade[y]++;
    }
}

void TopologicalSorting(int nod)
{
    used[nod]=1;

    for(vector < int > ::iterator it=G[nod].begin();it!=G[nod].end();++it)
        if(!used[*it])
            TopologicalSorting(*it);
    TSL.push_back(nod);
}

void Solve()
{
    for(int i=1;i<=N;i++)
        if(!used[i])
            TopologicalSorting(i);

    reverse(TSL.begin(),TSL.end());
}

void Print()
{
    freopen("sortaret.out","w",stdout);

    for(vector < int > ::iterator it=TSL.begin();it!=TSL.end();++it)
        printf("%d ",(*it));
}

int main()
{
    Read();
    Solve();
    Print();

    return 0;
}