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

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

vector<vector<int>> v(50001);
deque<int> sol;
vector<bool> viz(50001);

void dfs(int node)
{
    viz[node] = true;
    for (auto it : v[node])
        if (!viz[it])
            dfs(it);
    sol.push_front(node);
}

int main()
{
    int n,m;
    f >> n >> m;
    for (int i = 1; i <= m; ++i)
    {int a,b;
        f >> a >> b;
        v[a].push_back(b);
    }

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

    for(int i : sol)
        g<<i<<" ";
    return 0;
}