#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

using VI = vector<int>;
vector< vector<int> > G;
int N;
VI s, ge, viz;

void ReadGraph();
void TopologicalSorting();
void Write();

int main()
{
    ReadGraph();
    TopologicalSorting();
    Write();

    fin.close();
    fout.close();
    return 0;
}

void ReadGraph()
{
    int x, y, m;
    fin >> N >> m;
    G = vector< vector<int> >(N + 1);
    ge = viz = VI(N + 1);

    while ( m-- )
    {
        fin >> x >> y;

        G[x].push_back(y);
        ge[y]++;            // creste gradul exterior al nodului y
    }
}

void TopologicalSorting()
{
    int i, j;
    queue<int> Q;

    for ( i = 1; i <= N; ++i )
        if ( ge[i] == 0 )
            Q.push(i);

    while ( !Q.empty() ) // for ( i = 1; i <= N; ++i ) - n pasi
    {
        int x = Q.front();
        Q.pop();
        s.push_back(x);
        for ( const auto& v : G[x] )
        {
            ge[v]--;
            if ( ge[v] == 0 )
                Q.push(v);
        }
    }
}

void Write()
{
    for ( const auto& x : s )
        fout << x << ' ';
}