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.
[[-163, 20, -81, -51], [-45, -97], [-123, 41, -83, -104, -161, -74], [-169, -111, -114, 75, -199, -103, 82], [-89, -109, -121], [-118, 39, 96, 96, -194, -172], [96, -163, -103, -11, -186, -76, -56]]