In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[1, 31, -69, -197, -111, 42], [31, 97, -1, -200, -185, -55], [-53, -154, 36], [-40, 96, -166, -144, -86]]