#include "bits/stdc++.h"
using namespace std;
#define int               long long
#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define uniq(v)           (v).erase(unique(all(v)),(v).end())
#define sz(x)             (int)((x).size())
#define fr                first
#define sc                second
#define pii               pair<int,int>
#define rep(i,a,b)        for(int i=a;i<b;i++)
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define ppc               __builtin_popcount
#define ppcll             __builtin_popcountll
#define py cout<<"YES\n";
#define pn cout<<"NO\n";
#define print(a)          for(auto &i: a){ cout<<i<<" "; if(&i == &a.back()) cout<<endl;}
#define input(a)          for(auto &i: a){ cin>>i; }

template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.fr>>a.sc;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.fr<<" "<<a.sc;return out;}
template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}

int getGCD(int a,int b){ return b == 0 ? a : getGCD(b,a%b); }
int getLCM(int a,int b){ return abs(a*b)/getGCD(a,b); }

const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;

int longestAlternativeSequence(vector<int> &a){
    int n = a.size();
    int maxi1 = 0;
    int f1 = 0;
    for (int i = 0; i < n; i++) {
        if (!f1) {
            if (a[i] % 2) {
                f1 = 1;
                maxi1++;
            }
        }
        else {
            if (a[i] % 2 == 0) {
                maxi1++;
                f1 = 0;
            }
        }
    }
    int maxi2 = 0;
    int f2 = 0;
    for (int i = 0; i < n; i++) {
        if (f2) {
            if (a[i] % 2) {
                f2 = 1;
                maxi2++;
            }
        }
        else {
            if (a[i] % 2 == 0) {
                maxi2++;
                f2 = 0;
            }
        }
    }
    return max(maxi1, maxi2);
}

void solve(){
    int n,k; 
    cin>>n>>k;
    vector<int> v(n);
    input(v);
    cout<<longestAlternativeSequence(v)<<endl;
}


signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #ifdef SIEVE
        sieve();
    #endif
    #ifdef NCR
        init();
    #endif
    int t=1;
    cin>>t;
    while(t--){
        solve();
    } 
    return 0;
}   

This is my first code blog with the full functionality