SP26348 NINJA5 - K NUMBERS

**Problem statement:** You are given N numbers from 1 to N. Now, your task is to choose some numbers from the N numbers (including 1 & N) such that no two numbers are **consecutive****.** As this is easy, you are given an extra task. You have to definitely choose K numbers which are given. Find the maximum number of numbers that you can choose in such a way. **Input:** The first line has an integer T, the number of test cases. Then for each test case, the first line has two integers N and K. Then the next line has K numbers which you should definitely chooose. **Output:** For each test case, print the maximum number of numbers that you can choose. **Constraints:** 1

N/A

N/A