#include <iostream>
#include<bits/stdc++.h>

using namespace std;

ifstream in("topsort.in");
ofstream out("topsort.out");

const int NMAX=1e5+10;
bitset < NMAX > Seen;
vector < int > Results, Edge[NMAX];
int n, m;
deque < int > R;

void Read()
{
    in>>n>>m;
    int x, y;
    for(int i=1; i<=m; i++)
        in>>x>>y, Edge[x].push_back(y);
}

void DFS(int x)
{
    Seen[x]=1;
    for(int i : Edge[x])
        if(Seen[i]==0)
            DFS(i);
//    Results.push_back(x);
    R.push_front(x);
}

int main()
{
    Read();
    for(int i=1; i<=n; i++)
        if(Seen[i] == 0)
            DFS(i);
//    reverse(Results.begin(), Results.end());
//    for(int i : Results)
//        out<<i<<' ';
    for(int i : R)
        out<<i<<' ';
    return 0;
}