#include <cstdio>
#include <vector>
#include <stack>
#include <bitset>
using namespace std;
FILE *f=fopen("sortaret.in","r");
FILE *g=fopen("sortaret.out","w");

const int NMAX = 50005;
const int MMAX = 100005;

vector<int> Muchii[NMAX];
vector<int> st;

bool viz[NMAX];

void DFS(int nodCurent)
{
    viz[nodCurent] = 1;
    for(int i =0;i<Muchii[nodCurent].size();i++)
    {
        int vecin=Muchii[nodCurent][i];
        if(!viz[vecin])
        {
            DFS(vecin);
        }
    }
    st.push_back(nodCurent);
}

int main()
{
    int n, m, x, y, i, j;
    fscanf(f,"%d%d",&n,&m);

    for(i=1; i<=m; i++)
    {
        fscanf(f,"%d%d",&x,&y);
        Muchii[x].push_back(y);
    }

    for(i=1; i<=n; i++)
    {
        if(!viz[i])
            DFS(i);
    }

    /*while(!st.empty())
    {
        fprintf(g,"%d ",st.top());
        st.pop();
    }
    */
    for(int i=st.size()-1;i>=0;i--)
        fprintf(g,"%d ",st[i]);


    fclose(f);
    fclose(g);
    return 0;
}