#include <bits/stdc++.h>

using namespace std; const int maxn = 1e2 + 5, maxK = 1e4 + 5;

int n, K, a[maxK];

inline void Exit() { exit(0 * puts("YouAreFake!")); }

vector<int> G[maxK]; int deg[maxK];

struct edge { int u, v; } E[maxK];

int las[maxn], lv[maxK];

bool iq[maxn];

queue<int> q;

inline bool check(int j, int i)
{
    static int Deg[maxK]; memcpy(Deg, deg, sizeof(int) * (K + 1)), Deg[i]++;
    if (las[a[i]]) Deg[las[a[i]]]++;
    q.push(1);
    int ct = 0;
    while (q.size())
    {
        int u = q.front(); q.pop(), ct++;
        // cerr << u << endl;
        for (int v : G[u]) if (--Deg[v] == 0) q.push(v);
        if (u == j && --Deg[i] == 0) q.push(i);
        if (u == i && --Deg[las[a[i]]] == 0) q.push(las[a[i]]);
    }
    return ct == i;
}

int main()
{
    scanf("%d%d", &n, &K);
    for (int i = 1; i <= K; i++) scanf("%d", a + i);
    if (a[1] != 1) Exit();
    iq[1] = 1;
    // cerr << check(1, 2) << endl;
    // return 0;
    for (int i = 2, j = 1; i <= K; i++)
    {
        while (j < i && (!check(j, i) || iq[a[i]])) iq[a[j++]] = 0;
        if (i == j) Exit();
        iq[a[i]] = 1;
        if (las[a[i]]) G[i].push_back(las[a[i]]), deg[las[a[i]]]++; las[a[i]] = i;
        E[i - 1] = { j, i }, G[j].push_back(i), deg[i]++;
        // cerr << j << ' ' << i << endl;
    }
    for (int i = 1; i <= K; i++) if (!deg[i]) q.push(i);
    int Tl = 0;
    while (q.size())
    {
        int u = q.front(); q.pop(), lv[u] = ++Tl;
        // cerr << "u: " << u << endl;
        for (int v : G[u]) if (--deg[v] == 0) q.push(v);
    }
    // cerr << Tl << endl;
    puts("YouAreWrite!");
    printf("%d\n", K - 1);
    for (int i = 1; i < K; i++) printf("%d %d %d\n", a[E[i].u], a[E[i].v], lv[E[i].v] - lv[E[i].u]);
    return 0;
}