#include <bits/stdc++.h>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");


#define cin fin
#define cout fout
/*
*/

const int MAXN=2e5;
int n, m, x, y;
map<int,vector<int>>rel;
int visited[MAXN];
deque<int>rez;


void read()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        rel[x].push_back(y);
    }
}


void print(deque<int> v)
{
    for(auto el:v)
        cout<<el<<" ";
    cout<<"\n";
}

void rec(int nod)
{
    visited[nod]=1;
    for(auto vec:rel[nod])
        if(!visited[vec])
            rec(vec);
    rez.push_front(nod);
}


void sortareTopologica()
{
    for(int i=1; i<=n; i++)
    {
        if(!visited[i])
            rec(i);
    }
}


void solve()
{
    sortareTopologica();
    print(rez);
}


int main()
{
    read();
    solve();

    return 0;
}