#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#define cout cerr
#define MAX 50005
using namespace std;

int n,m,b[MAX],x,y;
vector <int> a[MAX];
stack <int> nod;

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d %d",&n,&m);

    for(int i=1; i<=m; i++)
    {
        scanf("%d %d",&x,&y);
        int ok=1;
        for(int j=0; j<a[x].size(); j++)
            if(a[x][j]==y)
                ok=0;
        if(ok)
        {
            b[y]++;
            a[x].push_back(y);
        }
    }

    /*for(int i=1;i<=n;i++,cout<<endl)
        for(int j=0;j<a[i].size();j++)
            cout<<a[i][j]<<" ";*/


    for(int i=1; i<=n; i++)
        if(b[i]==0)
            nod.push(i);

    while(!nod.empty())
    {
        x=nod.top();
        nod.pop();
        if(b[x]==0)
            printf("%d ",x),b[x]--;
        for(int i=0; i<a[x].size(); i++)
        {
            b[a[x][i]]--;
            nod.push(a[x][i]);
        }
    }

    return 0;
}