#include <bits/stdc++.h>
#define FOR(n) for(int i=1;i<=n;++i)
using namespace std;

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

const int NMAX = 100005;
int n, m;
vector<int>graf[NMAX];
bool viz[NMAX];
vector<int>idx;

inline void dfs(int nod)
{
    viz[nod] = 1;
    for(auto x : graf[nod])
        if(!viz[x])
            dfs(x);
    idx.push_back(nod);
}

inline void solve()
{
    for(int i=1;i<=n;++i)
    {
        if(!viz[i])
        {
            dfs(i);
        }
    }
    for(int i=idx.size()-1;i>=0;--i)
        fout << idx[i] << ' ';
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=m;++i)
    {
        int x, y;
        fin >> x >> y;
        graf[x].push_back(y);
    }
    solve();
}