#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define MAX 50010

typedef vector<int> :: iterator iter;
vector<int> G[MAX];

bool viz[MAX];
int st[MAX], dr, n, m, x, y;
void df(int nod)
{
    viz[nod] = 1;
    for(iter it = G[nod].begin() ; it != G[nod].end() ; it++)
    {
        if(!viz[*it])
            df(*it);
    }
    st[++dr] = nod;
}

int main()
{
    int i;
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    for(i = 1 ; i <= n ; i++)
    {
        if(!viz[i])
            df(i);
    }
    for(i = dr ; i >= 1 ; i--)
    {
        fout << st[i] << " ";
    }
    return 0;
}