#include <bits/stdc++.h>

using namespace std;

constexpr int N = 107, K = 1e4 + 7;

#define ull unsigned long long
#define inf (1ull << 60)
#define NO cout << "YouAreFake!\n", exit(0)

vector <tuple <int, int, ull>> ans;
#define push(x, y, z) ans.emplace_back(x, y, z)
void print() {
	cout << "YouAreWrite!\n";
	for (auto [x, y, z] : ans) {
		cout << x << ' ' << y << ' ' << z << '\n';
	}
}

int n, k, q[K];
ull dis[N], e[N];

int cnt[N];
bool vis[K];

int main() {
	ios :: sync_with_stdio(0), cin.tie(0);
	cin >> n >> k;
	for (int i = 1; i <= n; ++i) dis[i] = inf;
	for (int i = 1; i <= k; ++i) cin >> q[i];
	for (int i = k; i; --i) {
		if (!cnt[ q[i] ]) vis[i] = 1;
		++cnt[ q[i] ];
	}
	if (!vis[1] || q[1] != 1) NO;
	for (int i = 1; i <= n; ++i) e[i] = 0;
	dis[1] = 0;
	for (int l = 1, r; l < k; l = r) {
		r = l + 1;
		while (!vis[r]) ++r;
		for (int i = l + 1; i < r; ++i) cnt[ q[i] ] = 0;
		for (int i = l + 1; i < r; ++i) {
			++cnt[ q[i] ];
			if (cnt[ q[i] ] > 1) NO;
			--dis[ q[i] ];
			push(q[l], q[i], dis[ q[i] ] - dis[ q[l] ]);
			e[ q[i] ] = max(e[ q[i] ], inf - dis[ q[i] ]);
		}
		dis[ q[r] ] = dis[ q[l] ] + e[ q[l] ];
		push(q[l], q[r], e[ q[l] ]);
	}
	print();
	return 0;
}