Use the method of corners to solve the linear programming problem.

Kane Manufacturing has a division that produces x model A grates and y model B grates. To produce each model A grate requires 3 lb of cast iron and 6 min of labor. To produce each model B grate requires 4 lb of cast iron and 3 min of labor. The profit for each model A grate is $1.50, and the profit for each model B grate is $2.50. Available for grate production each day are 1,000 lb of cast iron and 20 labor-hours. Because of a backlog of orders for model B grates, Kane's manager has decided to produce at least 180 model B grates per day. How many grates of each model should Kane produce to maximize its profits?

(x, y) =

What is the maximum profit (in dollars)?