#include <bits/stdc++.h>
using namespace std;
int d[50000];
queue<int>ord;
int N,M,a,b,i,j;
unordered_map<int, int>m;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
void showq(queue<int> gq)
{
    queue<int> c= gq;
    while (!c.empty()) {
        g<<c.front()<<' ';
        c.pop();
    }

}
int main()
{


    f>>N>>M;
    for(i=1;i<=M;++i)
    {
        f>>a>>b;
        if(m.find(b)== m.end())
         m.insert(make_pair(b,a));
        else
        m.insert(make_pair(b+50000,a));
        ++d[b];
    }
//for (auto x : m)
      //cout << x.first << " " << x.second << endl;

     for(i=1;i<=N;++i)
    {
        if(d[i]==0)
        { ord.push(i);
         for(j=1;j<=N;++j)
          if(m[j]==i || m[j+50000]==i)
           {--d[j];
            if(d[j]==0)
           { ord.push(j);
            d[j]=-1;}
           }
        }
    }
    showq(ord);
    return 0;
}