Shopping Options Problem Statement

Given arrays representing the costs of pants, shirts, shoes, and skirts, and a budget amount 'X', determine the total number of valid combinations that can be purchased such that the total cost does not exceed 'X'. Each purchase must include exactly 1 item from each list.

Input:

The first line contains an integer ‘T’ denoting the number of test cases. Each test case consists of:
 - Five integers ‘P’, ‘Q’, ‘R’, ‘S’, and ‘X’, representing the number of pants, shirts, shoes, skirts, and the budget amount, respectively.
 - The second line contains ‘P’ integers, denoting the cost of each pant.
 - The third line contains ‘Q’ integers, denoting the cost of each shirt.
 - The fourth line contains ‘R’ integers, denoting the cost of each shoe.
 - The fifth line contains ‘S’ integers, denoting the cost of each skirt.

Output:

For each test case, return an integer that represents the total number of valid combinations. Each result should be output on a new line.

Example:

Example input not provided in the original prompt.

Constraints:

• 1 <= T <= 100
• 1 <= P, Q, R, S <= 10
• 1 <= X <= 10^9
• 1 <= pants[i], shirts[i], shoes[i], skirts[i] <= 10^9

Note:

You do not need to print anything. Focus on implementing the required function to return the results.