#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int N = 50010;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, x, y, gi[N];
vector <int> v[N];
queue <int> q;
int main()
{
    f >> n >> m;
    for(; m; m--)
    {
        f >> x >> y;
        v[x].push_back(y);
        gi[y]++; /// gi = grad intern
    }
    for(int i = 1; i <= n; i++)
        if(!gi[i])
            q.push(i);
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        g << x << ' ';
        for(unsigned int i = 0; i < v[x].size(); i++)
        {
            gi[v[x][i]]--;
            if(!gi[v[x][i]])
                q.push(v[x][i]);
        }
    }

    return 0;
}