#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int N = 50005;
vector <int>v[N];
bool viz[N];
int postordine[N];
int n,m,nr;
void dfs(int nod){
    viz[nod] = 1;
    int i;
    for(i = 0;i < v[nod].size();i++){
        if(!viz[v[nod][i]])
            dfs(v[nod][i]);
    }
    postordine[++nr] = nod;
}
int main()
{
    int x,y,cnt = 0,i;
    cin >> n >> m;
    for(i = 1;i <= m;i++){
        cin >> x >> y;
        v[x].push_back(y);
    }
    for(i = 1;i <= n;i++){
        if(viz[i] == 0){
            dfs(i);
        }
    }
    for(i = nr;i > 0;i--)
        cout << postordine[i] << " ";
    return 0;
}