#include <fstream>
#include <vector>

using namespace std;
const int N = 50010;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

vector <int> a[N];
vector <int> coada;
int n, m, x, y;
int viz[N];

void DFS(int nod)
{
    viz[nod] = 1;
    for (int i = 0; i < a[nod].size(); i++)
        if (viz[a[nod][i]] == 0)
            DFS(a[nod][i]);
    coada.push_back(nod);
}

void Read()
{
    fin >> n >> m;
    while (m--)
    {
        fin >> x >> y;
        a[x].push_back(y);
    }
}

int main()
{
    Read();
    for (int i = 1; i <= n; i++)
        if (viz[i] == 0)
            DFS(i);
    for (int i = coada.size() - 1; i >= 0; i--)
        fout << coada[i] << " ";
    return 0;
}