Maximum Candies

You are given a matrix $A$ with $N$ rows (numbered $1$ through $N$) and $M$ columns (numbered $1$ through $M$). You need to fill the matrix with candies in such a way that: - For each cell, the number of candies in this cell is an integer between $0$ and $X$ inclusive. - For each pair of adjacent cells, the number of candies in one cell plus the number of candies in the other cell does not ex