#include <fstream>
#include <vector>

using namespace std;

const int N = 50005;

std::ifstream in("sortaret.in");
std::ofstream cout("sortaret.out");

vector<int> gr[N], top;
bool viz[N];

void dfs(int nod)
{
    viz[nod] = true;
    for (auto vec : gr[nod])
        if (!viz[vec])
            dfs(vec);
    top.push_back(nod);
}

int main()
{

    int n, m;
    in >> n >> m;
    while (m--)
    {
        int x, y;
        in >> x >> y;
        gr[x].push_back(y);
    }
    in.close();
    for (int i = 1; i <= n; ++i)
        if (!viz[i])
            dfs(i);
    for (int i = top.size() - 1; i >= 0; --i)
        cout << top[i] << " ";
    cout.close();
    return 0;
}