#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,cnt;
vector<int>g[100005];
vector<int>gint[100005];
vector<int>ext(100005);
vector<int>viz(100005);
stack<int>sol;
void citire()
{
    cin >> n >> m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
        ext[x]++;
        gint[y].push_back(x);
    }
}
void dfs(int st)
{
    viz[st]=1;
    for(auto i:g[st])
        if(!viz[i])
            dfs(i);
    sol.push(st);
}
void parcurgere()
{
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
}
int main()
{
    citire();
    parcurgere();
    while(!sol.empty())
        cout << sol.top() << ' ',sol.pop();
    return 0;
}