#include <bits/stdc++.h>
#define NMAX 50001

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
vector<int> V[NMAX];
bool use[NMAX];

struct nod{
    int info;
    nod *next;
}*L;

void addList(nod *&L, int x) {
    if(L == NULL) {
        L = new nod;
        L->info = x;
        L->next = NULL;
    } else {
        nod *p = new nod;
        p->info = L->info;
        p->next = L->next;
        L->info = x;
        L->next = p;
    }
}

void printList(nod *&L) {
    for(nod *p = L; p != NULL; p = p->next) {
        fout << p->info << ' ';
    }
}

void DFS(int nod) {
    use[nod] = 1;
    for(int i = 0; i < V[nod].size(); i++) {
        if(!use[V[nod][i]])
            DFS(V[nod][i]);
    }
    addList(L, nod);
}

int main()
{
    fin >> n >> m;
    int a, b;
    while(m--) {
        fin >> a >> b;
        V[a].push_back(b);
    }
    for(int i = 1; i <= n; i++)
        if(!use[i])
            DFS(i);
    printList(L);
    return 0;
}