#include <cstdio>
#include <vector>
#include <queue>
#define lim 50000
using namespace std;
vector<int>graf[lim];
queue<int>Q;
bool viz[lim];
int n,m;
void citire()
{
    scanf("%d %d",&n,&m);
    for(int i =0 ; i < m ; i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        graf[x].push_back(y);
    }
}

int top;
void dfs(int nod)
{
    viz[nod] = true;
    Q.push(nod);
    for(int i = 0; i < graf[nod].size();i++)
    {
        if(!viz[graf[nod][i]])
            {
                dfs(graf[nod][i]);

                top = nod;
            }
    }

}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    for(int i = 1; i<=n;i++)
    {
        if(viz[i] == false)
        dfs(i);
    }
    while(!Q.empty())
    {
      printf("%d ",Q.front());
      Q.pop();
    }
    return 0;
}