#include <bits/stdc++.h>

using namespace std;

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

const int Nmax  = 50005;

vector <int> L[Nmax];
int viz[Nmax], sol[Nmax];
int n, ln;


void Read()
{
    int x, y, m;
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    fin.close();
}

void DFS(int k)
{
    viz[k] = 1;
    for(auto i : L[k])
        if(!viz[i]) DFS(i);
    sol[++ln] = k;
}

void Do()
{
    int i;
    for(i = 1; i <= n; i++)
        if(!viz[i]) DFS(i);
}

void Write()
{
    int i;
    for(i = ln; i >= 1; i--)
        fout << sol[i] << " ";
    fout.close();
}

int main()
{
    Read();
    Do();
    Write();
    return 0;
}