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

class Reader {
  public:
    Reader() {}
    Reader(const char *file_name) {
        input_file = fopen(file_name, "r");
        cursor = 0;
        fread(buffer, SIZE, 1, input_file);
    }
    inline Reader &operator >>(int &n) {
        while(buffer[cursor] < '0' || buffer[cursor] > '9') {
            advance();
        }
        n = 0;
        while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
            n = n * 10 + buffer[cursor] - '0';
            advance();
        }
        return *this;
    }
  private:
    FILE *input_file;
    static const int SIZE = 1 << 17;
    int cursor;
    char buffer[SIZE];
    inline void advance() {
        ++ cursor;
        if(cursor == SIZE) {
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
    }
};

class Writer {
  public:
    Writer(const char *name):
        m_stream(name) {
        memset(m_buffer, 0, sizeof(m_buffer));
        m_pos = 0;
    }

    Writer& operator<<(int a) {
        int many = 0;
        do {
            digit_buffer[many++] = a % 10 + '0';
            a /= 10;
        } while (a > 0);
        for (int i = many - 1; i >= 0; --i)
            putchar(digit_buffer[i]);
        return *this;
    }

    Writer& operator<<(const char *s) {
        for (; *s; ++s)
            putchar(*s);
        return *this;
    }

    ~Writer() {
        m_stream.write(m_buffer, m_pos);
    }

  private:
    void putchar(char c) {
        m_buffer[m_pos++] = c;
        if (m_pos == kBufferSize) {
            m_stream.write(m_buffer, m_pos);
            m_pos = 0;
        }
    }

    static const int kBufferSize = 32768;
    ofstream m_stream;
    char m_buffer[kBufferSize];
    char digit_buffer[30];
    int m_pos;
};

int n,m;
vector<vector<int>> adj(50001);
vector<int> incomingEdges(50001);
vector<int> sorted;
queue<int> q;

int main() {
    Reader fin("sortaret.in");
    Writer fout("sortaret.out");

    fin>>n>>m;
    for(int i=1; i<=m; i++) {
        int src,dest;
        fin>>src>>dest;
        adj[src].push_back(dest);
        incomingEdges[dest]++;
    }

    for(int i=1; i<=n; i++)
        if(incomingEdges[i]==0)
            q.push(i);

    while(!q.empty()) {
        int current=q.front();
        q.pop();
        sorted.push_back(current);
        for(auto next:adj[current])
            if(--incomingEdges[next]==0)
                q.push(next);
    }

    for(auto it:sorted)
        fout<<it<<" ";

    return 0;
}