Given street of houses (a row of houses), each house having some amount of money kept inside; now there is a thief who is going to steal this money but he has a constraint/rule that he cannot steal/rob two adjacent houses. Find the maximum money he can rob.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N and money.
Print maximum money he can rob.
1 ≤ T ≤ 100
1 ≤ money ≤ 100
1 ≤ N ≤ 1000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.