B"You have a board represented as a grid with 2 x n cells. The first k_1 cells on the first row and first k_2 cells on the second row are colored in white. All other cells are colored in black. You have w white dominoes ( 2 x 1 tiles, both cells are colored in white) and b black dominoes ( 2 x 1 tiles, both cells are colored in black). You can place a white domino on the board if both board's cells are white and not occupied by any other domino. In the same way, you can place a black domino if both cells are black and not occupied by any other domino. Can you place all w + b dominoes on the board if you can place dominoes both horizontally and vertically? The first line contains a single integer t ( 1 <= t <= 3000 ) -- the number of test cases. The first line of each test case contains three integers n , k_1 and k_2 ( 1 <= n <= 1000 ; 0 <= k_1, k_2 <= n ). The second line of each test case contains two integers w and b ( 0 <= w, b <= n ). For each test case, print YES if it's possible to place all w + b dominoes on the board and NO, otherwise. You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer). In the first test case, n = 1 , k_1 = 0 and k_2 = 1 . It means that 2 x 1 board has black cell (1, 1) and white cell (2, 1) . So, you can't place any white domino, since there is only one white cell. In the second test case, the board of the same size 2 x 1 , but both cell are white. Since w = 0 and b = 0 , so you can place 0 + 0 = 0 dominoes on the board. In the third test case, board 2 x 3 , but fully colored in black (since k_1 = k_2 = 0 ), so you can't place any white domino. In the fourth test case, cells (1, 1) , (1, 2) , (1, 3) , and (2, 1) are whit"...