#include <fstream>
#include<stack>
#include<queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
stack<int> q;
vector<int> a[50001];
int n,m;
bool v[50001];
void dfs(int k){
    int i;
    v[k]=true;
    for(size_t i=0;i<a[k].size();i++)
        if(!v[a[k][i]])
            dfs(a[k][i]);
    q.push(k);
}
int main(){
    int i,j,h;
    fin>>n>>m;
    for(h=1;h<=m;h++){
        fin>>i>>j;
        a[i].push_back(j);
    }
    fin.close();
    for(i=1;i<=n;i++)
        if(!v[i])
            dfs(i);
    while(!q.empty()){
        fout<<q.top()<<" ";
        q.pop();
    }
    fout.close();
    return 0;
}