#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define nMax 50005

using namespace std;
vector <int> v[nMax];
queue <int> C;
int n, m;
bool seen[nMax];
void read()
{
    ifstream fin("sortaret.in");
    fin >> n >> m;
    int x, y;
    for(int i = 1; i <= m; ++i){
        fin >> x >> y;
        v[x].push_back(y);
    }
}
void dfs(int x)
{
    for(int i = 0; i < v[x].size(); ++i){
        if(!seen[v[x][i]]){
            seen[v[x][i]] = 1;
            C.push(v[x][i]);
            dfs(v[x][i]);

        }
    }
}
void sortare_topologica()
{
    for(int i = 1; i <= n; ++i)
      if(!seen[i]){
         seen[i] = 1;
         C.push(i);
         dfs(i);
      }
}
void write()
{
    ofstream fout("sortaret.out");
    while(!C.empty()){
        fout << C.front() << ' ';
        C.pop();
    }
}
int main()
{
    read();
    sortare_topologica();
    write();
    return 0;
}