#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

int n,m,grad[50100],c[50100];
vector<int> graf[50100];

void read()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d\n", &n,&m);
    for(int i=1,x,y;i<=m;i++)
        scanf("%d%d\n",&x,&y),graf[x].push_back(y), grad[y]++;
}

void solve(void)
{
    int i, x; vector<int>::iterator it;

    for(x = 1; x <= n; x++)
     if(grad[x] == 0) c[++c[0]] = x;

    for(i = 1; i <= n; i++)
    {
        x = c[i];
        for(it = graf[x].begin(); it != graf[x].end(); ++it)
        {
            grad[*it]--;
            if(grad[*it] == 0) c[++c[0]] = *it;
        }
    }
}



void print()
{
    int i;
    for(i = 1; i <= n; i++)
        printf("%d ", c[i]);
}

int main(void)
{


    read();
    solve();
    print();

    return 0;
}