// 願ったんなら叶えてしまえやって
// Think twice, code once.
#include <tuple>
#include <vector>
#include <bitset>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n, k, q[10005], f[105], vis[105];
long long dis[105];
vector<tuple<int, int, long long>> edge;

int main() {
	freopen("meow.in", "r", stdin);
	freopen("meow.out", "w", stdout);
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= k; i++) scanf("%d", &q[i]);
	if (q[1] != 1) {puts("YouAreFake!"); return 0;}
	for (int i = 1; i <= n; i++) f[q[i]] = i;
	for (int i = 1; i <= n; i++) dis[i] = 1ll << 60;
	int lst = 1;
	for (int i = 2; i <= k; i++) {
		if (vis[i]) {puts("YouAreFake!"); return 0;}
		if (f[q[i]] != i) edge.emplace_back(lst, q[i], --dis[q[i]]);
		else edge.emplace_back(lst, q[i], 0), lst = q[i];
	}
	puts("YouAreWrite!");
	printf("%d\n", (int)edge.size());
	for (auto i : edge) printf("%d %d %lld\n", get<0>(i), get<1>(i), get<2>(i));
	return 0;
}