Use Euclid’s division lemma (algorithm) to find the HCF of 441, 567, 693

I know how to solve for 2 nos.

I'm quoting the source cited below.
The GCD of three or more numbers equals the product of the prime factors common to all the numbers,[13] which can be calculated by taking the GCDs of pairs of numbers.[14] For example,

GCD(a, b, c) = GCD(a, GCD(b, c)) = GCD(GCD(a, b), c) = GCD(GCD(a, c), b).

Thus, Euclid's algorithm, which computes the GCD of two integers, suffices to calculate the GCD of arbitrarily many integers.