Given an array of positive integers and a number **K** where K is used as threshold value to divide each element of the array into sum of different numbers. Find the sum of count of the numbers in which array elements are divided.

**Input:**

The first line of input contains a single integer **T** denoting the number of test cases. Then** T** test cases follow. Each test case consist of two lines. The first line of each test case consists of an integer **N** and **K**, where **N** is the size of array and K is the threshold value. The second line of each test case contains **N** space separated integers denoting array elements.

**Output:**

Corresponding to each test case, print the total count.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 10^{7}

0 ≤ A_{i} ≤ 10^{7}

1 ≤ K ≤ 10^{7}

**Example:**

**Input**:

1

4 3

5 8 10 13

**Output:**

14

**Explanation:**

**Testcase 1: **Each number can be expressed as sum of different numbers less than or equal to K as 5 (3 + 2), 8 (3 + 3 + 2), 10 (3 + 3 + 3 + 1), 13 (3 + 3 + 3 + 3 + 1). So, the sum of count of each element is 14.

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

geetyadav | 82 |

hari32147 | 76 |

AdityaRaj9 | 75 |

yashrana1 | 74 |

amitpandey19 | 67 |

abducodes | 850 |

harshtyagi36 | 417 |

vamsikrishna55 | 323 |

sandipbhaumik | 321 |

Akhil varma | 314 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.