#include <fstream>
#include <vector>

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n, m, cnt;
vector<int> v[100005];
int viz[100005];
int top[100005];

void dfs(int nod)
{
    viz[nod] = 1;

    for(auto it: v[nod])
    {
        if(viz[it] == 0)
        {
            dfs(it);
        }
    }

    cnt++;
    top[cnt] = nod;
}

int main()
{
    in>>n>>m;

    int x, y;
    for(int i = 1; i<=m; i++)
    {
        in>>x>>y;

        v[x].push_back(y);
    }

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

    for(int i = cnt; i>=1; i--)
    {
        out<<top[i]<<" ";
    }

    return 0;
}