#include <iostream>
#include <vector>
#include <fstream>
#include <stack>
using namespace std;
#define MAX 50001
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> ag[MAX];
stack <int> st;
int n, m, viz[MAX];
void citire()
{
    int i, x, y;
    f>>n>>m;
    for (i=0; i<m; ++i) {
        f>>x>>y;
        ag[x].push_back(y);
    }
    f.close();
}

void dfs(int s)
{
    int i;
    viz[s]=1;
    for(i=0; i<ag[s].size();++i)
        if (!viz[ag[s][i]])
           dfs(ag[s][i]);
    st.push(s);
}

int main() {

    citire();
    dfs(1);
    for (int i=1; i<=n; ++i)
        if (!viz[i])
            dfs(i);
    while (!st.empty())
    {
        g<<st.top()<< " ";
        st.pop();
    }
    return 0;
}