#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
// to fidn th eminimum # of operations simply count the # of numbers < or equivalent
// bc it is only asking us to output the # of changes, we do not need to perform them making
// this question easy
int main() {
	int t;
	cin >> t;
	while(t--) {
		int n,k;
		int sol = 0;
		cin >> n >> k;
		set<int> seen;
		for(int i =0;i < n; i++) {
			int temp; cin >> temp;
			if(temp == k) {
				sol++;
			}
 
			if(0 <= temp && temp < k) {
				seen.insert(temp);
		}
 
		}
		int Z = k - (int)seen.size();
		int ans = max(sol,Z);
		cout << ans << endl;
}
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c2V0Pgp1c2luZyBuYW1lc3BhY2Ugc3RkOwovLyB0byBmaWRuIHRoIGVtaW5pbXVtICMgb2Ygb3BlcmF0aW9ucyBzaW1wbHkgY291bnQgdGhlICMgb2YgbnVtYmVycyA8IG9yIGVxdWl2YWxlbnQKLy8gYmMgaXQgaXMgb25seSBhc2tpbmcgdXMgdG8gb3V0cHV0IHRoZSAjIG9mIGNoYW5nZXMsIHdlIGRvIG5vdCBuZWVkIHRvIHBlcmZvcm0gdGhlbSBtYWtpbmcKLy8gdGhpcyBxdWVzdGlvbiBlYXN5CmludCBtYWluKCkgewoJaW50IHQ7CgljaW4gPj4gdDsKCXdoaWxlKHQtLSkgewoJCWludCBuLGs7CgkJaW50IHNvbCA9IDA7CgkJY2luID4+IG4gPj4gazsKCQlzZXQ8aW50PiBzZWVuOwoJCWZvcihpbnQgaSA9MDtpIDwgbjsgaSsrKSB7CgkJCWludCB0ZW1wOyBjaW4gPj4gdGVtcDsKCQkJaWYodGVtcCA9PSBrKSB7CgkJCQlzb2wrKzsKCQkJfQoJCQkKCQkJaWYoMCA8PSB0ZW1wICYmIHRlbXAgPCBrKSB7CgkJCQlzZWVuLmluc2VydCh0ZW1wKTsKCQl9CgoJCX0KCQlpbnQgWiA9IGsgLSAoaW50KXNlZW4uc2l6ZSgpOwoJCWludCBhbnMgPSBtYXgoc29sLFopOwoJCWNvdXQgPDwgYW5zIDw8IGVuZGw7Cn0KfQ==

NQoxIDAKMAozIDEKMCAyIDMKNSA1CjAgMSAyIDMgNAo2IDIKMCAzIDQgMiA2IDIKNyA0CjAgMSA1IDQgNCA3IDMK

5
1 0
0
3 1
0 2 3
5 5
0 1 2 3 4
6 2
0 3 4 2 6 2
7 4
0 1 5 4 4 7 3