Servers And Tasks

You are given ‘N’ servers and ‘M’ tasks. You are also given two arrays, ‘servers’ and ‘tasks’, where ‘server[i]’ represents the memory limit of i-th server, and ‘task[i]’ represents the memory required to schedule the i-th task. A server can be assigned multiple tasks as long as the limit is not exceeded. Your task is to check whether all the tasks can be scheduled or not.

For example:

You are given N = ‘3’, M = ‘5’.
servers = { 8, 8, 32 }
tasks = { 4, 4, 8, 12, 16 }
The answers will be true because :
Task 1 and task 2 can be assigned to server 1.
Task 3 can be assigned to server 2.
Task 4 and task 5 can be assigned to server 3.
In this way, we can schedule all the given tasks.

Input Format:

The first line contains an integer 'T' which denotes the number of test cases.

The first line of each test case contains two space-separated integers, ‘N’ and ‘M’, representing the number of servers and tasks, respectively.

The second line of each test case contains ‘N’ space-separated integers denoting the memory limit of each server.

The third line of each test case contains ‘M’ space-separated integers denoting the memory required to assign each task.

Output Format:

For each test case, print “true” if all the tasks can be scheduled. Otherwise, print “false”.

The output of each test case will be printed in a separate line.

Constraints:

1 <= T <= 10 
1 <= N, M  <= 8
1 <= servers[i] <= 10^9
1 <= tasks[i] <= 10^9

Time limit: 1 sec

Note:

You do not need to input or print anything, as it has already been taken care of. Just implement the given function.