#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

struct point {
    vector<int> child;
    int grad;
    bool used;
};

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<point> p;
vector<int> sol;

void f(int i) {
    if(p[i].used) return;
    for(int k=0;k!=(int)p[i].child.size();k++) {
        p[p[i].child[k]].grad--;
        f(p[i].child[k]);
    }
    if(p[i].grad == 0) {
        sol.push_back(i);
        p[i].used = true;
    }
}

int main()
{
    int n,m;
    fin>>n>>m;
    point a;
    a.grad = 0;
    a.used = false;
    p.resize(n+1, a);
    while(m-->0) {
        int x,y;
        fin>>x>>y;
        p[x].child.push_back(y);
        p[y].grad++;
    }
    for(int i=1;i<=n;i++) {
        f(i);
    }
    for(int i=n-1;i>=0;i--) {
        fout<<sol[i]<<" ";
    }

    return 0;
}