#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n,m;

bool vis[50000];
vector<vector<int>>adj(100000);
stack<int>ans;

void dfs(int nod){
    vis[nod] = 1;
    for(auto v : adj[nod]) if(!vis[v]) dfs(v);
    ans.push(nod);
}

int main()
{   
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    cin >> n >> m;
    for(int i =0;i<m;i++){
        int a,b;
        cin >> a >> b;
        a--;
        b--;
        adj[a].pb(b);
    }
  
    for(int i = 0;i<n;i++){
        if(!vis[i]) dfs(i);
    }
    while(ans.size()){
        cout<<ans.top()+1<<" ";
        ans.pop();
    }
    


    return 0;
}