#include <iostream>
#include <fstream>
#include <queue>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

const int NMax = 5e4 + 5;
typedef long long ll;

int N,M;
int inDeg[NMax];
vector<int> v[NMax];
queue<int> Q;

int main()
{
    in>>N>>M;
    for (int i=1;i<=M;++i) {
        int x,y;
        in>>x>>y;
        v[x].push_back(y);
        ++inDeg[y];
    }

    for (int i=1;i<=N;++i) {
        if (inDeg[i] == 0) {
            Q.push(i);
        }
    }

    while (Q.size()) {
        int n = Q.front();
        Q.pop();
        out<<n<<' ';

        for (int k=0;k < (int)v[n].size();++k) {
            int next = v[n][k];
            inDeg[next]--;
            if (inDeg[next] == 0) {
                Q.push(next);
            }
        }
    }
    in.close();out.close();
    return 0;
}