// https://szkopul.edu.pl/problemset/problem/nldsb4EW1YuZykBlf4lcZL1Y/site/?key=statement

#include <bits/stdc++.h>

using namespace std;

constexpr int sizik = 1000 * 1001;

std::vector<std::pair<int, int>> kra2[sizik];

int rp[sizik], cnt = 1, vis1 = 1;

std::vector<int> kra[sizik], kra1[sizik], post;
int visited[sizik];

std::pair<int, int> in[sizik];
int out[sizik];

void DFS(int v) {
    if (visited[v] == vis1) {
        return;
    }

    visited[v] = vis1;

    for (const auto& u : kra[v]) {
        DFS(u);
    }

    post.push_back(v);
}

void DFS1(int v) {
    if (visited[v] == vis1) {
        return;
    }

    visited[v] = vis1;
    rp[v] = cnt;

    for (const auto& u : kra1[v]) {
        DFS1(u);
    }
}

void DFS2(int v, int i) {
    if (i != 0) {
        if (out[i] == 0) {
            out[i] = (int)(in[i].first != v) + 1;
        }
    }
    if (visited[v] == vis1) {
        return;
    }

    visited[v] = vis1;

    for (const auto& [u, j] : kra2[v]) {
        DFS2(u, j);
    }
}

int main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);

    int n, m;
    std::cin >> n >> m;

    for (int i = 1; i <= m; i++) {
        int a, b;
        std::cin >> a >> b;

        kra2[a].push_back({b, i});
        kra2[b].push_back({a, i});

        in[i] = {a, b};
    }

    vis1++;
    for (int i = 1; i <= n; i++) {
        if (visited[i] != vis1) {
            DFS2(i, 0);
        }
    }
    vis1++;

    for (int i = 1; i <= m; i++) {
        const auto [a, b] = in[i];
        if (out[i] == 2) {
            kra[a].push_back(b);
            kra1[b].push_back(a);
        } else {
            kra[b].push_back(a);
            kra1[a].push_back(b);
        }
    }

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

    int ans = 0;
    vis1++;
    for (int i = post.size() - 1; i >= 0; i--) {
        if (visited[post[i]] != vis1) {
            cnt++;
            ans++;
            DFS1(post[i]);
        }
    }

    std::cout << ans << '\n';
    for (int i = 1; i <= m; i++) {
        if (out[i] == 1) {
            std::cout << "<";
        } else {
            std::cout << ">";
        }
    }
    std::cout << "\n";

    return 0;
}