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.
[[-85, -168, -118, 96, 7, -55, -86], [-123, -153, -55, -193], [-115, -95, 27, -167, -78, -81], [-104, -54, 27, -119, -104, 94, -121], [-85, -147, 51], [-1, -177, -105], [-138, 21, -81, 35], [50, 38, -99, -73, -175, -82], [-53, 1, 44, 3, 20, -191]]