In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
15, 25, ['8563', '3387', '9151', '5577', '2001', 'O', 'V', 'H', 'g', 'A', '8587', '8165', 'N', 'Z', 'S', 'h', 'f', '8637', '4267', '3501', '9463', 'u', 'r', 'c', 'V', '7589', 'N', '4255', '3787']