#include <cstdio>
#include <bitset>
#include <cstring>

using namespace std;

int N,M,nCase,OR[210][210],t[210][210];


int main()
{
    scanf("%d",&nCase);
    while (nCase--) {

        scanf("%d%d",&N,&M);
        memset(OR, 0, sizeof(OR));
        memset(t, 0, sizeof(t));

        for(int i=1; i<=N; ++i)
        {
            scanf("%d",&OR[i][i]);
            for(int j=i-1; j>=1; --j)
                OR[j][i] = OR[j+1][i] | OR[j][j];
        }

        t[0][0] = 65535;

        for(int i=1; i<=M; ++i)
        {
            int l = N-M+i-1;

            if(i==1) l = 0;

            //prev
            for(int j=i-1; j <= l; ++j)
            {
                int nl = N-M+i;
                //cur
                for(int k=j+1; k<=nl; ++k)
                {
                    int val = t[i-1][j] & OR[j+1][k];

                    if(bitset<16>(val).count() > bitset<16>(t[i][k]).count())
                        t[i][k] = val;
                }
            }
        }
        printf("%d\n",bitset<16>(t[M][N]).count());
    }
    return 0;
}