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.
[[-123, -34, -48, -100, -143], [-11, 46, 61, 37, -156], [-26, -52, -131], [-190, -136, -31, 22, -138, 18], [-166, 66, -148, -44, -194], [-28, -76, -176, 28, -101, -183], [-160, 59], [45, -121, -43], [-13, -116, 74]]