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.
2, 10, ['j', 'o', '3815', '631', '3845', '125', 'e', 'G', '1849', 'Z', 'l', '7697', '8091', '5005', 'l', 'e']