This is a nonogram with the usual rules. That is, you must fill white squares in with black so that the numbers at the head of each row or column indicate, in order, the respective lengths of sequences of black squares in that row or column.
…except that I've committed a no-no. There are four ambiguous squares in the diagram: seemingly, either a specific two of them or the other two can be colored black. Normally that means the nonogram is unsolvable. In this case, though, you'll find that only one of those possibilities yields a valid solution.