#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define inf INT_MAX
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, x, y;
bool viz[50001];
vector <int> g[50001];
stack <int> St;
void dfs(int nod)
{
    viz[nod]=1;
    for(auto &x:g[nod])
    {
        if(viz[x]==0)
        {
            dfs(x);
        }
    }
    St.push(nod);
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
        }
    }
    while(!St.empty())
    {
        fout<<St.top()<<" ";
        St.pop();
    }
    return 0;
}