#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;

vector<int> raspuns;
vector<int>a[50005];bitset <50005> viz;

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

void dfs(int x)
{
    viz[x]=1;
    for(auto y : a[x])
    {
        if(!viz[y])
        {
            dfs(y);
        }
    }
    raspuns.push_back(x);
}

int main()
{

    int n,m;
    in>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        in>>x>>y;
        a[x].push_back(y);
    }

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

    while(n--)
    {
        out<<raspuns[n]<<" ";
    }

    /*while(!q.empty())
    {
        int w=q.front();
        q.pop();
        for(auto nod:a[w])
        {
            nrp[nod]--;
            if(nrp[nod]==0)
            {
                q.push(nod);
            }
        }
        out<<w<<" ";
    }
*/
    return 0;
}