#include <bits/stdc++.h>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<vector<int>> G;
vector<int> d;
int n;

void rd()
{
    int x, y;
    f>>n>>x;
    G.resize(n+1);
    d.resize(n+1, 0);
    while(f>>x>>y)
    {
        G[x].push_back(y);
        d[y]++;
    }
}

vector<int> topsort()
{
    vector<int> r;
    queue<int> q;

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

    while(q.size())
    {
        int x=q.front();
        q.pop();
        r.push_back(x);
        for(auto a:G[x])
        {
            d[a]--;
            if(!d[a])
                q.push(a);
        }
    }
    return r;
}

int main()
{
    rd();

    for(auto a:topsort())
        g<<a<<' ';

    f.close();
    g.close();
    return 0;
}