#include <fstream>
#include <vector>
#include <queue>
#define oo 0x7fffffff
using namespace std;

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

int n, m;
vector<int> adj[50001];
queue<int> q;
int grd[50001];

bool check_vertice(int x, int y)
{
    for (int i = 0; i < adj[x].size(); i++)
        if (adj[x][i] == y)
            return true;

    return false;
}

int main()
{
    int x, y;

    fin >> n >> m;
    while (m--)
    {
        fin >> x >> y;
        if (!check_vertice(x, y))
        {
            adj[x].push_back(y);
            grd[y]++;
        }
    }

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

    while (q.size())
    {
        int k = q.front();
        q.pop();
        for (int i = 0; i < adj[k].size(); i++)
        {
            grd[adj[k][i]]--;
            if (grd[adj[k][i]] == 0)
                q.push(adj[k][i]);
        }

        fout << k << ' ';
    }
}