def binarySerch(lines:Array[(Long,Long,String)],ip:Long):Int = {
  var low = 0
  var high = lines.length-1
  while (low <= high){
    val middle = (low+high)/2
    if((ip >= lines(middle)._1) && (ip <= lines(middle)._2))
      return middle
    if (ip < lines(middle)._1)
      high = middle - 1
    if(ip > lines(middle)._2)
      low = middle + 1
  }
  -1
}