///SORTARE TOPOLOGICA
#include <iostream>
#include <fstream>
#include <utility>
#include <algorithm>
#include <vector>
#include <queue>
#define NMax 100001
///#define f cin
///#define g cout
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int> G[NMax];
int n, m, x, y, v[NMax], ans;
bool viz[NMax];

void dfs(int k)
{
    viz[k] = true;
    for(int i = 0; i < G[k].size(); ++i)
        if(!viz[G[k][i]]) dfs(G[k][i]);
    v[++ans] = k; /// inseamna ca nu mai are vecini deci poate fi pus in sortare...
}

int main()
{
    f >> n >> m;
    for(int i = 0; i < m; ++i)
    {
        f >> x >> y;
        G[x].push_back(y);
    }

    for(int i = 1; i <= n; ++i)
        if(!viz[i]) dfs(i);

    for(int i = ans; i > 0; --i)
        g << v[i] << " ";
    return 0;
}