using namespace std;
#include<cstdio>
#include<iostream>
#include<fstream>
#include<vector>
#define MAX 50005
struct nod{
    int info;
    nod *next;
};
vector<int> G[MAX],v;
int n;
nod *primu;

void pb(int k)
{
    nod *p=new nod;
    p->info=k;
    p->next=primu;
    primu=p;
}

void dfs(int k)
{
    v[k]=1;
    for(int i=0;i<G[k].size();i++)
    {
        int vecin=G[k][i];
        if(v[vecin]==0)
        {
            dfs(vecin);
        }
    }
    v[k]=2;
    pb(k);
}

int main()
{
    int m,i;
    ifstream fin("sortaret.in");
    freopen("sortaret.out","w",stdout);
    fin>>n>>m;
    v.assign(n+1,0);
    for(i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(v[i]==0)
            dfs(i);
    for(nod *p=primu; p ;p=p->next)
        printf("%d ",p->info);
    return 0;
}