Definition: 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.
Input: 10, 20, ['o', '923', '8177', '2857', '2237', '5269', '5397', '5933', 'f', '5037', 'l', 'o', '4931', '4889', 'h', '4121', '6651', 'w', '1717', '5069', 'I', '5975', 'F', '6105', '2473', '341', '5499', 'p']

32415