#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=30;
int n,m,k;
int p[N],t[N];
vector<int>pw[N];
int his[N][N];
ll G(int i,int p,int k,int z){
	if(!k)return 0;
	if(p==2&&k<3){
		// debug(i,p,k,z);
		if(~his[k][z%=pw[i][k+1]])
			return his[k][z];
		int cnt=0;
		for(int x=0;x<pw[i][k];x++){
			for(int y=!x;y<pw[i][k];y++){
				if((x*x+y*y)%pw[i][k+1]==z)cnt++;
				// debug(x,y,cnt);
			}
		}
		return his[k][z]=cnt;
	}
	if(k==1){
		if(p%4==3){
			if(z%p==0)return 0;
			else return p+1;
		}else{
			if(z%p==0)return 2*p-2;
			else return p-1;
		}
	}
	return G(i,p,k-1,z)*p;
}
ll F(int i,int p,int k,int z){
	if(!k)return z%p==0;
	if(k==1)return G(i,p,k,z)+(z%(p*p)==0);
	return G(i,p,k,z)+(z%(p*p)==0?G(i,p,k-2,z/p/p)*p*p:0);
}
ll solve(int i,int p,int k,int z){
	if(p==2){
		if(k==1)return F(i,p,k,z);
		else return F(i,p,k-1,z)*p*p;
	}else{
		return F(i,p,k,z);
	}
}
int main(){
	memset(his,-1,sizeof his);
	scanf("%d%d",&n,&m);
	for(int i=2;i*i<=n;i++){
		if(n%i)continue;
		p[++k]=i;
		for(;n%i==0;n/=i)t[k]++;
	}
	if(n>1){
		p[++k]=n,t[k]=1;
	}
	for(int i=1;i<=k;i++){
		pw[i].assign(t[i]+1,0);
		for(int j=pw[i][0]=1;j<=t[i];j++){
			pw[i][j]=pw[i][j-1]*p[i];
		}
	}
	debug("pri",ary(p,1,k));
	debug("cnt",ary(t,1,k));
	for(int x;m--;){
		scanf("%d",&x);
		ll ans=1;
		for(int i=1;i<=k;i++){
			ans*=solve(i,p[i],t[i],x);
		}
		printf("%lld%c",ans,"\n "[m>0]);
	}
	return 0;
}