#include<cstdio>
#include<list>

using namespace std;

list<int> a[50001];
list<int> sol;
int viz[50001];

void tsort(int nod)
{
    viz[nod]=1;
    while(!a[nod].empty())
    {
        if(viz[a[nod].front()]==0)
        {
            tsort(a[nod].front());
        }
        a[nod].pop_front();
    }
    sol.push_back(nod);
}

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

    int n,m;

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

    for(int i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);

        a[x].push_back(y);
    }

    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            tsort(i);
        }
    }

    while(!sol.empty())
    {
        printf("%d ",sol.back());
        sol.pop_back();
    }
}