int BinarySearch(int nNum, int nStart, int nEnd)
	{
		int nIndex = (nEnd-nStart)/2;
		nIndex+=nStart;
		if(DistLevelsArray[nIndex] <= nNum && DistLevelsArray[nIndex+1] > nNum)
			return nIndex+1;
		else if(DistLevelsArray[nIndex] >= nNum && DistLevelsArray[nIndex+1] >= nNum)
			return BinarySearch(nNum, nStart, nIndex);
		else if(DistLevelsArray[nIndex] <= nNum && DistLevelsArray[nIndex+1] <= nNum)
			return BinarySearch(nNum, nIndex+1, nEnd);
		else
			return nEnd;
	}