Given a City laid out on a grid, there are R rows of houses and C columns of houses. Each house is known to contain some amount of valuables totaling v_ij. Your task is to rob as many houses as possible to maximize the amount of loot. However, there is a security system in place and if you rob two adjacent houses an alarm will go off Find the optimum set of non-adjacent houses to rob.