#define NMAX 50005
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

int n, m;
int gr_int[NMAX];
vector<int> graph[NMAX];
queue<int> Q;


void read()
{
    int x, y;

    freopen("sortaret.in", "r", stdin);
    scanf("%d %d", &n, &m);

    for(int i=0; i<m; ++i)
    {
        scanf("%d %d", &x, &y);
        graph[x].push_back(y);
        ++gr_int[y];
    }

}

void add_gr_0()
{
    for(int i=1; i<=n; ++i)
        if(gr_int[i] == 0)
            Q.push(i);
}



void start()
{
    freopen("sortaret.out", "w", stdout);
    add_gr_0();
    while(!Q.empty())
    {
        int el = Q.front();

        for(auto &v:graph[el])
        {
            gr_int[v]--;
            if(gr_int[v] == 0)
                Q.push(v);
        }

        Q.pop();
        printf("%d ", el);
    }
}




int main()
{
    read();
    start();
    return 0;
}