Given a value **V**. You have to make change for V cents, given that you have infinite supply of each of C{ C1, C2, .. , Cm} valued coins. Find the minimum number of coins to make the change.

**Input:**

The first line of input contains an integer T denoting the number of test cases. The first line of each test case is V and N, V is the value of cents and N is the number of coins. The second line of each test case contains N input C[i], value of available coins.

**Output:**

Print the minimum number of coins to make the change, if not possible print "-1".

**Constraints:**

1 ≤ T ≤ 100

1 ≤ V ≤ 10^{6}

1 ≤ N ≤ 10^{6}

1 ≤ C[i] ≤ 10^{6}

**Example:**

**Input**:

1

7 2

2 1

**Output:**

4

**Explanation :
Testcase 1: **We can use coin with value 2 three times, and coin with value 1 one times to change a total of 7.

lakshmi_pandey | 72 |

abbatta7 | 68 |

Ashish Kumar Vaishy | 62 |

aman19 | 58 |

Kumar Gaurav Singh | 58 |

saumitra13325 | 612 |

ashujack | 551 |

lakshmi_pandey | 544 |

aman19 | 538 |

piyushmittal25 | 514 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.