#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

const int N = 50001;

vector <int> a[N];
bitset <N> viz;
int n, m, sol[N], nrs;

void dfs(int x)
{
    viz[x] = 1;
    for (auto y: a[x])
    {
        if (!viz[y])
        {
            dfs(y);
        }
    }
    sol[++nrs] = x;
}

int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;
        a[x].push_back(y);
    }
    in.close();
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            dfs(i);
        }
    }
    for (int i = nrs; i >= 1; i--)
    {
        out << sol[i] << " ";
    }
    out.close();
    return 0;
}