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

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

vector <int> A[50001];
vector <int> C;
bitset <50001> vi;
int n,a,b,i,m;

void dfs(int nod) {
    vi[nod]=1;
    int i;
    for (i=0;i<A[nod].size();i++)
        if (vi[A[nod][i]]==0)
            dfs(A[nod][i]);
    C.push_back(nod);
    return ;
}


int main () {
    f >> n >> m;
    for (i=1;i<=m;i++) {
        f >> a >> b;
        A[a].push_back(b);
    }
    for (i=1;i<=n;i++)
        if (vi[i]==0)
            dfs(i);
    for (i=C.size()-1;i>=0;i--) g << C[i] << ' ';
    f.close();g.close();
    return 0;
}