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


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

    int n,m;
    fin >> n >> m;

    vector<vector<int>> adj(n+1);
    vector<int> grad(n+1,0);

    for (int i = 0; i < n; ++i) {
        int a,b;
        fin >> a >> b;

        ++grad[b];
        adj[a].push_back(b);
    }

    queue<int> q;

    for (int i = 1; i <= n; ++i)
        if (grad[i] == 0)
            q.push(i);


    while(!q.empty()) {
        int nod = q.front();
        q.pop();

        fout << nod << ' ';

        for (auto vecin : adj[nod])
        {
            --grad[vecin];
            if (grad[vecin] == 0)
                q.push(vecin);
        }
    }

    return 0;
}