#include <bits/stdc++.h>

using namespace std;

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

int n,m,seen[50005];

vector <int> V[50005];

deque <int> u;

void dfs(int nod)
{
    seen[nod] = 1;
    u.push_back(nod);
    for(auto it:V[nod])
    {
        if(seen[it] == 0)
        {
            dfs(it);
        }
    }
    return;
}

int main()
{
    fin>>n>>m;
    for(int i = 1;i<=m;i++)
    {
        int a,b;
        fin>>a>>b;
        V[a].push_back(b);
    }
    for(int i = 1;i<=n;i++)
    {
        if(seen[i]==0)
        {
            dfs(i);
        }
    }
    while(!u.empty())
    {
        fout<<u.front()<<' ';
        u.pop_front();
    }
}