UPDATE

UVA 10050
----------
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (int i=a;i<=b;i++)
#define sq(a) (a)*(a)
//solution
int arr[4];
int solve(){
w(t){
int day,team;
cin>>day;

int darr[day+1]={0};
darr[6]=2;
for(int i=13;i<=day;i+=7){
    darr[i]=2;

}
cin>>team;
while(team--){

       int n;
       cin>>n;
       for(int i=n;i<=day;i+=n){
        if(darr[i]==0){
            darr[i]=1;

        }
            }

}


int sum=0;
REP(i,1,day){
  if(darr[i]==1 && i%7!=0){
     sum++;

  }
}
cout<<sum<<endl;



}


return 0;
}
//end solution
int main(){
solve();
}