We study optimal pricing for an M/M/k/N queue with several customer types. The prices the system manager charges the customers only depend on the number of customers in the system. In addition, the system incurs a holding cost as a lump sum to the customer who pays the price and enters the system. The holding costs do not depend on customer types and are non-decreasing with respect to the number of customers in the system. This paper studies average reward criterion and describes the classes of stationary optimal policies, canonical policies, bias optimal policies, and Blackwell optimal policies. In addition, we show that the bias optimal policy is unique, is Blackwell optimal, and is the trunk reservation policy with the lowest optimal prices. The following files are the conference version: