#include <bits/stdc++.h>
#define NMAX 50001

using namespace std;

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

int n, m, g[NMAX];
vector <int> v[NMAX];

void unif()
{
    for(int i=1; i<=n; i++)
    {
        sort(v[i].begin(), v[i].end());
        v[i].resize(distance(v[i].begin(),unique(v[i].begin(), v[i].end())));
        for(auto& j:v[i])
        {
            g[j]++;
        }
    }
}

bool viz[NMAX];
void bfs(queue <int> q)
{
    while(!q.empty())
    {
        int x=q.front();
        viz[x]=1;
        fout<<x<<" ";
        for(auto& j:v[x])
        {
            g[j]--;
            if(!g[j] && !viz[j])
            {
                //cout<<j;
                viz[j]=1;
                q.push(j);
            }
        }
        q.pop();
    }
}

stack <int> S;
void dfs(int x, int k)
{
    viz[x]=k;
    for(auto& j:v[x])
    {
        if(!viz[j]) dfs(j, k);
    }
    S.push(x);
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int a, b;
        fin>>a>>b;
        v[a].push_back(b);
    }
    unif();
    queue <int> q;
    for(int i=1; i<=n; i++) if(!g[i])q.push(i);
    bfs(q);
    /*int k=1;
    for(int i=1; i<=n; i++)
    {
        if(!viz[i])
        {
            dfs(i, k);
            k++;
        }
    }*/
    while(!S.empty())
    {
        fout<<S.top()<<" ";
        S.pop();
    }
}