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

using namespace std;

ifstream F("sortaret.in");
ofstream G("sortaret.out");

int n, m, x, y;
bitset<50005> v;
vector<int> a[50005];
stack<int> st;

void dfs( int x )
{
    v[x] = 1;
    vector<int> :: iterator it;
    for( it = a[x].begin(); it != a[x].end(); ++ it )
        if(!v[*it]) dfs(*it);
    st.push(x);
}

int main()
{
    F >> n >> m;
    for( int i = 1; i <= m; ++ i )
    {
        F >> x >> y;
        a[x].push_back(y);
    }
    for(int i = 1; i <= n; ++ i)
        if(!v[i]) dfs(i);
    while(!st.empty())
        G << st.top() << " ", st.pop();
    return 0;
}