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

#define u_int unsigned int

using namespace std;

vector<vector<u_int> > L(50000 + 1);
vector<bool> viz(50000 + 1);
stack<u_int> sol;

void travad(u_int i)
{
    viz[i] = 1;
    for(vector<u_int>::iterator it = L[i].begin(); it != L[i].end(); it++)
    {
        if(viz[*it] == false)
        {
            travad(*it);
        }
    }
    sol.push(i);
}

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    u_int n, m;
    fin >> n >> m;
    for(u_int i = 1; i <= m; i++)
    {
        u_int x, y;
        fin >> x >>y;
        L[x].push_back(y);
    }
    for(u_int i = 1; i <= n; i++)
    {
        if(viz[i] == false)
        {
            travad(i);
        }
    }
    while(sol.empty() == false)
    {
        fout << sol.top() << ' ';
        sol.pop();
    }
    return 0;
}