#include <fstream>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <bitset>

using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

const int NMAX = 5e4 + 5;
vector<vector<int>> g;
vector<int> sortare;
int gr[NMAX];
queue<int> q;

void sorteaza()
{
    while(!q.empty())
    {
        int nod = q.front();
        sortare.push_back(nod);
        q.pop();
        for(auto vecin : g[nod])
        {
            gr[vecin]--;
            if(gr[vecin] == 0)
                q.push(vecin);
        }
    }
}
int main()
{
    int n, m;
    cin >> n >> m;
    g.resize(n + 1);

    for(int i = 1; i <= m; i++)
    {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
        gr[y]++;
    }

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

    sorteaza();
    for(auto nodes : sortare)
        cout << nodes << ' ';
}