double find(vector <int> minJ, vector <int> maxJ, vector <int> minB, vector <int> maxB)   {
			int acuJ[51], acuB[51];
			memset(acuJ, 0, sizeof(acuJ));
			memset(acuB, 0, sizeof(acuB));
			for(int i=0; i<minJ.size(); ++i)
				for(int j=minJ[i]; j<=maxJ[i]; ++j)
					++acuJ[j];
			for(int i=0; i<minB.size(); ++i)
				for(int j=minB[i]; j<=maxB[i]; ++j)
					++acuB[j];
			for(int i=0; i<51; i++) printf("acuJ[%d] = %d, acuB[%d] = %d\n", i, acuJ[i], i, acuB[i]);
			int aJ, aB;
			aJ = accumulate(acuJ, acuJ+51, 0);
			aB = accumulate(acuB, acuB+51, 0);
			printf("aB = %d , aJ = %d\n", aB, aJ);
			vector<double> probJ(51, 0.0), probB(51, 0.0);
			double result = 0.0;
			for(int i=0; i<probJ.size(); ++i){
				probJ[i] = (double)acuJ[i]/(double)aJ;
				probB[i] = (double)acuB[i]/(double)aB;
				result += (probB[i]*probJ[i]);
			}
			return result;
        }