#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <cstdio>

#define Nmax 50600

using namespace std;

int N,M;
vector<int> Gt[Nmax],sol;
bitset<Nmax> used;

void Read()
{
    scanf("%d%d",&N,&M);
    int a,b;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d%d",&a,&b);
        Gt[b].push_back(a);
    }
}

void DFS(int k)
{
    used[k] = 1;
    for(vector<int>::iterator it = Gt[k].begin(); it != Gt[k].end(); ++it)
        if(!used[*it])
            DFS(*it);
    printf("%d ",k);
}


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

    Read();
    for(int i = 1; i <= N; ++i)
        if(!used[i])
            DFS(i);

    return 0;
}