<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def lstlei(x, n, array):
 """ Given a number x and an array of non-decreasing ints, find the index of the largest array element less than or equal to x. http://naif.jpl.nasa.gov/pub/naif/toolkit_docs/C/cspice/lstlei_c.html :param x: Value to search against. :type x: int :param n: Number elements in array. :type n: int :param array: Array of possible lower bounds :type array: list :return: index of the last element of array that is less than or equal to x. :rtype: int """

    array = stypes.toIntVector(array)
    x = ctypes.c_int(x)
    n = ctypes.c_int(n)
    return libspice.lstlei_c(x, n, array)