#include <cstdio>
#include <vector>
using namespace std;
const int nmax=50000;
int n,m;
vector<int>v[nmax+5];
int tata[nmax+5];/// este tata daca tata[i] = 0
bool viz[nmax+5];
void dfs(int nod)
{
    printf("%d ",nod);
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(viz[v[nod][i]]==0)
            dfs(v[nod][i]);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
        tata[b]=1;
    }
    for(int i=1;i<=n;i++)
    {
        if(tata[i]==0)
        {
            dfs(i);
        }
    }
    return 0;
}
/**

**/