#K13151. Book Lending Fulfillment

    ID: 23849 Type: Default 1000ms 256MiB

Book Lending Fulfillment

Book Lending Fulfillment

In this problem, you are given multiple test cases. For each test case, there are several books available in certain quantities and a corresponding set of requests for these books. Your task is to determine for each test case if all the book requests can be fulfilled using the available copies. Specifically, for each test case, if for every book, the number of requested copies is less than or equal to the number of available copies, then the answer is "Fulfills"; otherwise it is "Not Fulfills".

The mathematical condition for each test case is given by: [ \forall i \in {1, 2, \ldots, n},\quad r_i \leq a_i ] where (a_i) represents the number of available copies for the (i^{th}) book and (r_i) represents the number of copies requested.

Read the input from standard input (stdin) and write your output to standard output (stdout).

inputFormat

The first line contains an integer (T) representing the number of test cases. For each test case, the input is given in three lines:

  1. A single integer (n) which specifies the number of books.
  2. (n) space-separated integers representing the available copies of each book.
  3. (n) space-separated integers representing the requested copies for each book.

Example: 2 3 5 3 10 2 1 7 2 2 2 3 1

outputFormat

For each test case, output one line containing either "Fulfills" if all requests can be satisfied, or "Not Fulfills" if at least one request cannot be met.## sample

2
3
5 3 10
2 1 7
2
2 2
3 1
Fulfills

Not Fulfills

</p>