Please help me make a java programming

Expert Q&A Done Make a java programming. Another Brick in the Wall The construction worker previously known as Lars has many bricks of height I and different lengths, and he is now trying to build a wall of width w and height h. Since the construction worker peeviously known as Lars knows that the subset sum problem is NP-hard, he does not try to optimize the placement but he just lays the beicks in the order they are in his pile and hopes for the best. First he places the bricks in the first layer, left to right, after the first layer is complete he moves to the second layer and completes it, and so on He only lays bricks horizontally, without rotating them. If at some point he cannot place a beick and has to leave a Layer incomplete, then he gets annoyed and leaves. Iit does not matter if he has beicks left over after he finlishes Yesterday the construction worker previously known as Lars got really annoyed when he realized that he could not complete the wall only at the last layer, so he tore it down and asked you for help. Can you tell whether the construction worker previously known as Lars will complete the wall with the new pile of beicks he has today? Input The first line contains three integers ,w,Ish s 100,1sws 100,1 sn S 10000), the height of the wall, the width of the wall, and the number of bricks respectively. The second line contains n integers 1 x, 10), the length ofeach brick Output Output Tes if the construction worker previousl known as Lars will complete the wall, and wo otherwise Output Outpat YEs if the construction werker previously known as Lars wil complete the wall, and so otherwise Sample Input 1 Sample Output 1 Sample Input 2 Sample Output 2