#include <iostream>
#include <fstream>
#include <vector>
#define DMAX 50005
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
vector <int> st, a[DMAX];
bool s[DMAX];
int n,m;

void DF (int nod)
{
    for (int i = 0; i < a[nod].size(); i++)
        if (s[a[nod][i]] == false) DF(a[nod][i]);
    st.push_back(nod);
    s[nod] = true;
}

void Read()
{
    f>>n>>m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f>>x>>y;
        a[x].push_back(y);
    }
}

void Solve()
{
    for (int i = 1; i <= n; i++)
        if (s[i] == false)
            DF(i);
    for (int i = st.size() - 1; i >= 0; i--)
        g<<st[i]<<' ';
}

int main()
{
    Read();
    Solve();
    return 0;
}