某蒟蒻做了半年 结果还没做出来

下放代码：

#include<bits/stdc++.h>
using namespace std;
int n,m,a[305],b[305],p[305];
int lcm(int a,int b){
	int ta = a, tb = b,t,r;
    while (tb != 0){
        r = ta%tb;
        ta = tb;
        tb = r;
    }
    t = a/ta*b;
    return t;
}
bool isp(int x){
	int a;
	if(x==1){
		return 0;
	}
	if(x==2){
		return 1;
	}
	a=2;
	while (a<=sqrt(x)&&x%a!=0){
		a++;
	}
	if(x%a==0){
		return 0;
	}
	else return 1;
}
int main(){
	scanf("%d%d",&n,&m);
	int cnt=1;
	for(int i=1;i<=2011;i++){
		if(isp(i)){
			p[cnt]=i;
			cnt++;
		}
	}
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		a[i]+=p[i];
		if(a[i]!=1){
			a[i]=lcm(a[i-1],a[i]);
			printf("%d ",a[i]);
		}
	}
	for(int i=1;i<=m;i++){
		scanf("%d",&b[i]);
		printf("%d\n",a[n]%b[i]);
	}
	return 0;
}