Neil and his Binary Tree

Neil has a [perfect binary tree](https://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees) with $N$ nodes, and an integer $M$. He can assign values to nodes. He calls the tree good if the following conditions are met: - Nodes' values are positive integers no more than $M$. - Nodes at even levels have values strictly more than their parents' values. - Nodes at odd levels have values strictly