#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m, vizat[50005];
vector <int> graphs[50005];
stack <int> solutia_domnule;

void solve(int nod)
{
    vizat[nod] = 1;
    unsigned len =  graphs[nod].size(), i;
    for(i = 0; i < len; i++)
    {
        if(vizat[graphs[nod][i]] == 0)
            solve(graphs[nod][i]);
    }
    vizat[nod] = 2;
    solutia_domnule.push(nod);
}

int main()
{
    fin >> n >> m;
    int i, x, y;
    for(i = 0; i < m; i++)
    {
        fin >> x >> y;
        graphs[x].push_back(y);
    }
    for(i = 1; i <= n; i++)
    {
        if(vizat[i] == 0)
            solve(i);
    }
    while(!solutia_domnule.empty())
    {
        fout << solutia_domnule.top() << ' ';
        solutia_domnule.pop();
    }
    return 0;
}