#include <iostream>
#include <fstream>
#include <vector>
#define nmax 50005
using namespace std;

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

int n, m;
int a, b;
vector <int> vecin[nmax], sortare;
bool VIZ[nmax];

void dfs(int nod) {
    VIZ[nod] = true;
    for (int i = 0; i < vecin[nod].size(); i++)
        if (!VIZ[vecin[nod][i]]) {
            VIZ[vecin[nod][i]] = true;
            sortare.push_back(vecin[nod][i]);
            dfs(vecin[nod][i]);
        }
}

int main() {
    
    fin >> n >> m;
    
    for (int i = 1; i <= m; i++)
        fin >> a >> b,
        vecin[a].push_back(b);
    
    for (int i = 1; i <= n; i++)
        if (!VIZ[i]) {
            sortare.push_back(i);
            dfs(i);
        }
    
    for (int i = 0; i < n; i++)
        fout << sortare[i] << " ";
    fout << "\n";
    
    fin.close();
    fout.close();
    
    return 0;
}