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

using namespace std;

vector<vector<int> > L(50000 + 1);
stack<int> sol;
bool viz[50000 + 1];
int n, m;
int cc;

void travad(int i)
{
    viz[i] = 1;
    for(std::vector<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");
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        L[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(viz[i] == 0)
        {
            travad(i);
        }
    }
    while(sol.empty() == false)
    {
        fout << sol.top() << ' ';
        sol.pop();
    }
}