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

using namespace std;

const int NMAX = 50000+2;
const int MMAX = 100000+2;

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

int N,M;
int PostOrdine[NMAX];
int TSort[NMAX];
vector<int> V[NMAX];
bitset<NMAX> Viz;

void DFS(int x)
{
    vector<int>::iterator y;

    Viz[x]=1;

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

    PostOrdine[++M]=x;
}

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,j;

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

    for(i=1,j=N; i<=N; i++,j--)
        TSort[i]=PostOrdine[j];
}

void Print()
{
    int i;

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