#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

const int maxn = 100001;
vector <int> Graf[maxn];
bool viz[maxn];
int ct,sol[maxn];

int DFS(int nod)
{
    viz[nod]=1;
    for(auto i : Graf[nod])
        if(!viz[i])
            DFS(i);
        sol[++ct]=nod;
}

int main()
{
    int n,m,x,y;
    in>>n>>m;
    while(m--)
    {
        in>>x>>y;
        Graf[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
            DFS(i);
    for(int i=1;i<=n;i++)
        out<<sol[i]<<" ";
    return 0;
}