WACHOVIA - Wachovia Bank


Danilo Gheyi is a renowned bank robber. He is known worldwide for accomplishing the most profitable bank robbery, in Fortaleza, Ceará. Danilo and his friends dug a tunnel to get into the main chest. There were some bags, with different amounts of money or jewelry and weight. They had to leave about 50% of the total value, since the truck couldn't carry all the bags.

Danilo wasn't caught, and to show that he can do itall again, he is planning a robbery to one of the safer banks in USA -the Wachovia Bank. He wants your help to maximize the amount stolen, avoiding a huge loss as it happened in Fortaleza.

Write a program that, given the maximum weight the truck is ableto carry and the information about each bag in the bank, determine the maximum value that Danilo can steal.

Input

The input consists of several instances. There is an integer N (1 ≤ N ≤ 200) in the first line; it stands for the number of instances. The first line of each instance contains two integers, K and M (8 ≤ K ≤ 1000 and 1 ≤ M ≤ 50) representing, respectively, the maximum weight the truck can handle and the amount of bags in the bank. The next M lines describe each bag with two integers A and B (8 ≤ A ≤ 200 and 1 ≤ B ≤ 25): the weight and the value of the bag, respectively.

Output

For each instance output a sentence “Hey stupid robber, you can get P.”, and P represents the maximum value Danilo can steal.

Example

Input:
3
34 5
178 12
30 1
13 7
34 8
87 6
900 1
900 25
100 10
27 16
131 9
132 17
6 5
6 23
56 21
100 25
1 25
25 25
100 2

Output:
Hey stupid robber, you can get 8.
Hey stupid robber, you can get 25.
Hey stupid robber, you can get 99.

hide comments
sanjay: 2016-05-27 12:28:05

SIMPLE 0/1 KNAPSACK nothing more.

Pranay Kumar: 2016-02-01 14:29:47

@sudhanshu monga
I wish I had read your comment before submitting..

sudhanshu monga: 2015-12-22 09:28:52

there is a fullstop after the maximum value in the output , costed me 4 WAs -_-

Vipul: 2015-12-18 08:12:42

one shot......AC :D

Aarush: 2015-09-24 19:15:18

theres a blank line in the input, cost me 3 nzec errors, pls correct it

Ravi: 2015-09-09 19:56:12


Last edit: 2015-09-09 19:56:24
Ravi: 2015-09-09 19:56:12

Super Easy :)

SangKuan: 2015-08-20 09:43:12

knapsack 0/1

Babu: 2015-08-19 22:42:16

Try PARTY after this.

Rishabh Joshi: 2015-06-24 12:14:20

took dp array 250 by 2000 , input array till 250.. still getting sigsegv. :/

EDIT - changed weight and value from struct to standalone, AC.

Last edit: 2015-06-29 18:37:27

Added by:Mateus Dantas [ UFCG ]
Date:2012-02-25
Time limit:0.201s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Mateus Dantas