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

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

const int N = 50001;
vector <int> a[N], sort_top;
bool viz[N];
int n, m;

void dfs(int x)
{
    viz[x] = 1;
    for(auto i : a[x])
    {
        if(!viz[i]) dfs(i);
    }
    sort_top.push_back(x);
}

int main()
{
    in >> n >> m;

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

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

    for(int i = sort_top.size() - 1; i >= 0; --i)
         out << sort_top[i] << " ";

    return 0;
}