#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

const int NMAX = 50005;
vector<int>G[NMAX];
int viz[NMAX];
int n,m;
stack<int>st;

void dfs(int nod)
{
    viz[nod] = 1;
    for(auto x : G[nod])
        if(!viz[x])
            dfs(x);
    st.push(nod);
}

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

    for(i=1;i<=n;++i)
        if(!viz[i])
            dfs(i);

    while(!st.empty())
    {
        fout << st.top() << ' ';
        st.pop();
    }
    return 0;
}