#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int NMAX = 50001;

int n,m,x,y;
bool vis[NMAX];
vector<int> gr[NMAX];
vector<int> sol;

void dfs(int k)
{
    vis[k] = 1;
    for (auto i: gr[k])
    {
        if(vis[i] == 0)
            dfs(i);
    }
    sol.push_back(k);
}


int main()
{
    fin>>n>>m;
    for (int i = 1; i <= m; i++)
    {
        fin>>x>>y;
        gr[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
    {
        if(vis[i] == 0)
            dfs(i);
    }
    reverse(sol.begin(), sol.end());
    for (auto i: sol)
        fout<<i<<" ";
}