#include<cstdio>
#include<vector>
#include<bitset>

using namespace std;

const int NMAX = 50000+5;

void Read(),Solve(),Print();

int N,M;
vector<int> V[NMAX];
vector<int> Postordine,SortareT;
bitset<NMAX> Viz;

void DFS(int nod)
{
    vector<int>::iterator it;

    Viz[nod] = 1;

    for(it = V[nod].begin(); it != V[nod].end(); it++)
        if(!Viz[*it]) DFS(*it);

    Postordine.push_back(nod);
}

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

    return 0;
}

void Read()
{
    int x,y;

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

    scanf("%d%d",&N,&M);

    for(; M; --M)
    {
        scanf("%d%d",&x,&y);
        V[x].push_back(y);
    }
}

void Solve()
{
    int i;

    for(i = 1; i <= N; i++)
        if(!Viz[i]) DFS(i);

    for(i = 0; i < N; i++)
        SortareT.push_back(Postordine[N-i-1]);
}

void Print()
{
    int i;

    for(i = 0; i < N; i++)
        printf("%d ",SortareT[i]);
}