#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

stack<int> s;

void dfs(int nod, vector<vector<int> > adiacenta, vector<bool> &viz)
{
    viz[nod] = true;
    for(int vecin : adiacenta[nod])
    {
        if(!viz[vecin])
            dfs(vecin, adiacenta, viz);
    }
    // i e finalizat
    s.push(nod);
}

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

    vector<vector<int> > adiacenta(n+1);
    vector<bool> viz(n+1, false);

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

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

    while(!s.empty())
    {
        int nod = s.top();
        out<<nod<<" ";
        s.pop();
    }

    return 0;
}