#include <fstream>
#include <vector>
#include <set>
#include <stack>
#include <queue>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m;
int x,y;
vector<set<int>> G;
vector<int> Gr;
struct cmp{
    bool operator () (const int &a,const int &b)
    {
        return Gr[a]>Gr[b];
    }
};
int main()
{
    cin>>n>>m;
    G.resize(n+1);
    Gr.resize(n+1);
    for(int i=0;i<m;i++)
    {
        cin>>x>>y;
        if(G[x].find(y)==G[x].end())
        {
        G[x].insert(y);
        Gr[y]++;
        }
    }
    priority_queue<int,vector<int>,cmp> Q;
    for(int i=1;i<=n;i++)
       Q.push(i);
    while(!Q.empty())
    {
        int cap=Q.top();
        cout<<cap<<" ";
        for(auto i=G[cap].begin();i!=G[cap].end();i++)
           {
               int vecin=*i;
               Gr[vecin]--;
           }
        Q.pop();
    }
    return 0;
}