#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define INF 0x3f3f3f3f
using namespace std;

ifstream is("sortaret.in");
ofstream os("sortaret.out");

int n, m;
bitset<50001> ok, rd;
vector<vector<int>> g;

void Solve(int x);

int main()
{
    int a, b;
    is >> n >> m;
    g = vector<vector<int>>(n + 1);
    while ( m-- )
    {
        is >> a >> b;
        g[a].push_back(b);
        rd[b] = 1;
    }
    for ( int i = 1; i <= n; ++i )
        if ( !rd[i] )
        {
            ok[i] = 1;
            Solve(i);
        }
    is.close();
    os.close();
    return 0;
}

void Solve(int x)
{
    ok[x] = 1;
    os << x << " ";
    for ( const auto& y : g[x] )
        if ( !ok[y] )
            Solve(y);
}