It is possible to use the procedure from the previous variant and, in addition, argue that each
row contains a maximum of 5 ‘two-column’ colors. If ‘two-column’ there were 6 colors, only 12 cells out of 21 could be colored in a given row, because another colors would no longer be available.
An alternative argument:
Again, we divide the colors into those that appear in at most two rows. Let’s call them bright, and the other dark.
The grid has 441 cells, so at least half of the colors are light or at least half are dark, w.l.o.g. consider that at least 221 cells are light-colored.
According to Dirichlet’s principle, at least one column \( C \) contains \( \lceil \frac{221}{21} \rceil = 11 \) bright cells. Each of these light colors has at most two occurrences in \( C \). Thus, \( C \) contains at least \( \lceil \frac{11}{2} \rceil = 6 \) light colors. Because each color has at most 6 occurrences in each column, there are only these light colors and no dark colors in the column \( C \). These light colors can color up to 12 cells of \( C \). The remaining cells would remain uncolored, which is a contradiction.