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.
[[48, -95, -125, 0, -14, -3, -124], [98, -70, -64, -151, 21, -91], [-26, -20, -93, -181, -161, -146], [-11, 88, 1], [-93, -133, -111, -72, -42], [30, -183, -151], [-9, -30, -59, -178, -14, 9, 44], [-167, -119, 27, -160], [-72, -33, 41, 93]]