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.
[[-51, -149, -53, 42], [64, 81, 80, -1], [35, 19, -36, -51, -178, 100, -149], [38, 6, -194, -10, -57], [34, 24, 67, 33, 96, -89, 82], [-36, -78, 33, -194, -165, -67, -66], [52, -46, -176], [39, 61, -13, -93, -198], [-64, -174, 15, -68, 84, -102]]