#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#define rep(i,a,n) for(int i = a;i <= n;i++)
#define per(i,n,a) for(int i = n;i >= a;i--)
#define enter putchar('\n')using namespace std;
const int M = 1005;
const int N = 1000005;
const int INF = 1e9;
double eps = 1e-7;
typedef long long ll;int read()
{int ans = 0,op = 1;char ch = getchar();while(ch < '0' || ch > '9'){if(ch == '-') op = -1;ch = getchar();}while(ch >= '0' && ch <= '9'){ans *= 10;ans += ch - '0';ch = getchar();}return ans * op;
}int t,n,m,dp[N],st[25][25];
bool pd[M];
double x[M],y[M];
int calc(int p,int q)
{if(x[p] == x[q]) return 0;double a = ((x[q] * y[p] / x[p]) - y[q]) / (x[q] * (x[p] - x[q]));double b = (y[p] - x[p] * x[p] * a) / x[p];
//    printf("%.2lf %.2lf\n",a,b);if(a >= 0) return 0;int res = 0;pd[p] = pd[q] = 1;//可以不单独消灭rep(i,1,n)//寻找其他可以被该小鸟消灭的猪
    {double dx = x[i],dy = y[i];if(fabs(a * dx * dx + b * dx - dy) < eps)res |= 1 << (i-1),dp[res] = 1;}return res;
}int main()
{t = read();while(t--){memset(dp,127/3,sizeof(dp));memset(pd,0,sizeof(pd));memset(st,0,sizeof(st));n = read(),m = read();rep(i,1,n) scanf("%lf%lf",&x[i],&y[i]),dp[1<<(i-1)] = 1;//消灭当前点的小猪需要一只鸟rep(i,1,n)rep(j,1,i-1) st[i][j] = calc(i,j);//计算每条抛物线能打到的猪rep(i,1,(1<<n)-1){rep(j,1,n){if(i & (1<<(j-1))) continue;//这猪已经G了if(!pd[j]) //只能单独消灭
                {dp[i|1<<(j-1)] = min(dp[i|1<<(j-1)],dp[i]+1);continue;}rep(k,1,j-1){if(i & (1<<(k-1))) continue;//这猪G了dp[i|st[j][k]] = min(dp[i|st[j][k]],dp[i] + 1);//更新答案
                }dp[i|1<<(j-1)] = min(dp[i|1<<(j-1)],dp[i] + 1);//单独消灭更好的话在这里更新
            }}printf("%d\n",dp[(1<<n)-1]);输出答案}return 0;
}
/*
1
2 0
1.00 3.00
3.00 3.00
*/