#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>

#define pb push_back

using namespace std;

const int NMax = 50005;
const int MMax = 100005;

int N, M;

vector < int > G[MMax];
queue < int > Q;
int dg[NMax];
int rez[NMax];

void Read()
{
    scanf("%d %d", &N, &M);

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

void Sor_Top()
{
    for(int i=1; i<=N; ++i)
        if(!dg[i])
            Q.push(i);

    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        rez[++rez[0]]=x;

        vector < int > ::iterator it;

        for(it=G[x].begin(); it!=G[x].end(); ++it)
        {
            dg[*it]--;
            if(dg[*it]==0)
                Q.push(*it);
        }
    }
}

void Print()
{
   for(int i=1; i<=rez[0]; ++i)
    printf("%d ", rez[i]);
}

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

    Read();
    Sor_Top();
    Print();

    return 0;
}