#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int N=50001;

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

vector<int> v[N];
queue<int> q;
bool viz[N];

void afiseaza()
{
    int nod;
    if(!q.empty())
    {
        nod = q.front();
        q.pop();
        afiseaza();
        out<<nod<<" ";
    }
}

void dfs(int nod)
{
    int i;
    viz[nod]=1;
    for(i=0;i<v[nod].size();i++)
        if(!viz[v[nod][i]])
            dfs(v[nod][i]);
    q.push(nod);
}

int main()
{
    int n,m,x,y,i;
    in>>n>>m;
    for (i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=N;i++)
        if(!viz[i])
            dfs(i);
    afiseaza();
    return 0;
}