#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <fstream>
#include <cctype>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <map>
#include <bitset>
#include <stack>
/*  //c++11
#include <unordered_map>
#include <unordered_set>
#include <tuple>
*/

using namespace std;
vector<int> V[50001];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int t[50001];
int order[50001],k;
bool used[50001];
void dfs(int n)
{
    used[n] = 1;
    for(int i = 0; i < V[n].size(); i++)
        if(!used[V[n][i]])
            dfs(V[n][i]);
    order[++k] = n;
}


int main()
{
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    int n,m,x,y;
    fin>>n>>m;
    for(int i = 1;i <= m;i ++)
    {
        fin>>x>>y;
        V[x].push_back(y);
    }
    int r = 1;
    for(int i = 1;i <= n; i++)
        if(!used[i])
            dfs(i);
    for(int i =n ;i >=1 ;i--)
        fout<<order[i]<<' ';

    return 0;
}


//FILE!!!