#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
using namespace std;

int n,m,gradint[50001],gradext[50001];
vector<int>graf[50001];
void citire()
{
    scanf("%d %d ",&n,&m);
    for(;m--;)
    {
        int a,b;
        scanf("%d %d",&a,&b);
        graf[a].push_back(b);
        gradint[b]++;
        gradext[a]++;
    }
}

void sortare()
{
    queue<int>s;
    for(int i=1;i<=n;i++)
    {
        if(!gradint[i])
        {
            s.push(i);
        }
    }
    vector<int>l;
    while(!s.empty())
    {
        int n=s.front();
        s.pop();
        l.push_back(n);
        for(int i=0;i<graf[n].size();i++)
        {
            gradint[graf[n][i]]--;
            if(!gradint[graf[n][i]])
                s.push(graf[n][i]);
        }
    }
    for(int i=0;i<l.size();i++)
        printf("%d ",l[i]);
}

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

    citire();
    sortare();
    return 0;
}