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.
9, 9, ['I', 'B', 'W', '7657', 'I', '5535', 'n', '1367', '9037', 'N', '7749', 'a', 'e', '7171', '8957', '5401', 'R', 'V', '3099', 'y']