#include <iostream>
#include <vector>
#include <stack>

using namespace std;

const int CMAX = 50005;

int n , m;
vector < int > v[CMAX];
stack <int> st;
bool viz[CMAX];

void dfs(int nod)
{
    viz[nod] = 1;
    int vn , vc , l;
    l = v[nod].size();
    for(int i=0;i<=l-1;i++)
    {
        vn = v[nod][i];
        if(viz[vn]==0)
        {
            dfs(vn);
            st.push(vn);
        }
    }
}

int main()
{
    freopen("sortaret.in","r",stdin);
    cin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        int x , y;
        cin >> x >> y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
            st.push(i);
        }
    }
    freopen("sortaret.out","w",stdout);
    while(!st.empty())
    {
        cout << st.top() << " ";
        st.pop();
    }
    return 0;
}