#include <cstdio>
#include <vector>
#include <set>
#include <queue>
#include <iostream>

int main ()
{
    int n, m, a, b;
    FILE *fin=fopen("sortaret.in","r");
    FILE *fout=fopen("sortaret.out","w");
    fscanf(fin, "%d%d", &n, &m);

    std::vector<std::vector<int> > v(n+1);
    std::vector<int> count(n+1);
    for(int i=1;i<=m;i++) {
        fscanf(fin, "%d%d", &a, &b);
        v[a].push_back(b);
        count[b]++;
    }
    std::vector<int> q;
    for(int i=1;i<=n;i++) {
        if(count[i]==0) {
            q.push_back(i);  
        }
    }

    std::vector<int> final;
    while(!q.empty()) {
        int nod = q.back(); q.pop_back();
        final.push_back(nod);

        for (auto& e: v[nod])
        {
            count[e]--;
            if(count[e]==0)
            {
                q.push_back(e);
            }
        }
    }
    for(auto& e: final)
    {
       fprintf(fout, "%d ", e); 
    }

    return 0;
}