1 #include <iostream>
 2 #include <cstdio>
 3 #include <cmath>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <string>
 7 #include <ctime>
 8 #include <queue>
 9 #include <vector>
10 #include <cstdlib>
11 using namespace std;
12 typedef long
 
 long LL;
13 const int MAXN = 45; 
14 const double eps = 1e-10;
15 int T,n,m,ans,dui[MAXN];
16 bool vis[MAXN];
17 double dd[MAXN][2];
18 double hehe,lim;
19 bool ok;
20 struct node{ double x,y; }a[MAXN];
21 inline bool cmp(node q,node qq){ if(q.x==qq.x) return q.y<qq.y; return q.x<qq.x; }
22 inline double
 
 ABS(double x){ if(x<0) return -x; return x; }
23 inline void dfs(int x,int num1,int num2,int use){
24     if(x==n+1) { if(use<ans) ans=use; return ;}    
25     double nowy; if(use>=ans) return ;
26     for(int i=1;i<=num2;i++) {
27         nowy=a[x].x*a[x].x*dd[i][0]+dd[i][1]*a[x].x;
28         if
 
(ABS(nowy-a[x].y)<=eps) { dfs(x+1,num1,num2,use); return ; }
29     }
30     int now; double nowx,nowz; int nex=num2+1;
31     for(int i=1;i<=num1;i++) {
32         if(vis[i]) continue; now=dui[i]; if(a[now].x==a[x].x) continue;        
33         nowx=a[now].x*a[now].x-a[now].x*a[x].x; nowz=a[now].y-a[x].y*a[now].x/a[x].x;
34         dd[nex][0]=nowz/nowx; if(dd[nex][0]>=-eps) continue;
35         dd[nex][1]=(a[now].y-dd[nex][0]*a[now].x*a[now].x)/a[now].x;
36         vis[i]=1; dfs(x+1,num1,nex,use);
37         vis[i]=0;
38     }
39 
40     dui[num1+1]=x; vis[num1+1]=0;
41     dfs(x+1,num1+1,num2,use+1);
42 }
43 
44 inline void work(){
45     scanf("%d",&T);
46     while(T--) {
47         scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) scanf("%lf%lf",&a[i].x,&a[i].y);    sort(a+1,a+n+1,cmp);
48         memset(vis,0,sizeof(vis)); memset(dd,0,sizeof(dd)); memset(dui,0,sizeof(dui));
49         dui[1]=1; if(m!=1) ans=n; else { ans=n/3; if(n%3!=0) ans++; ans++; }
50         dfs(2,1,0,1); printf("%d\n",ans);
51     }
52 }
53 
54 int main()
55 {
56     work();
57     return 0;
58 }