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.
[[-34, -134, -158, -17, -1], [-190, -35, -21, 50, 92], [-179, -103, -113, -161, -79], [-119, -79, -132], [23, -19, -182, -68], [-9, 71, -62, 1], [-68, -176, -107, 55, 0, -33], [-181, -109, -80, -180, -10], [-24, -111, 24, 41, -98, 3]]