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.
[[84, -40, -12, -169, -101, -139, -189], [-125, -146, 96, -88, 83, -88, -191], [-59, 24], [-22, -162, -37, -162, -151], [-196, 71], [-116, 25, -112, -168], [68, 83, -35, -74, -111, 55], [-128, -56, 97, -38, -155], [50, -103, -153, -84]]