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.
[[18, 20, -166, 39], [2, -16, -183, -68, -143], [2, -103, -160, 91, -58, -3, -130], [-165, -18, -87], [-83, -51]]