#include <fstream>
#include <vector>
#include <stack>

using namespace std;

bool vis[50005];
vector<int> G[50005];
stack<int> st;

void dfs(int i)
{
    vis[i] = 1;

    for(int x : G[i])
    {
        if(vis[x] == 0)
            dfs(x);
    }

    st.push(i);
}

int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");

    int n, m, x, y;
    cin >> n >> m;
    for(int i=0;i<m;i++)
    {
        cin >> x >> y;
        G[x].push_back(y);
    }

    for(int i=1;i<=n;i++)
    {
        if(vis[i] == 0)
            dfs(i);
    }

    while(!st.empty())
    {
        cout << st.top() << " ";
        st.pop();
    }
    return 0;
}