Here's a little challenge similar to the one I posted some months ago.

Consider a valid sudoku grid. There's a 1 and a 9 in each row and each column.

The extra constrain here is numbers from that 1 to the 9 on the same row/column must be always in ascending order.

By that I mean for example 13479, but not 14379.

**Example:**Show

Q- Is it possible a sudoku with this constrain which givens are only 1s and 9s, but with a unique valid solution?