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.
7, 20, ['a', 'n', '5913', 'B', '7233', 'n', 'w', 'C', '5845', 'T', '4327', 'Z', '9369', '9241', 'I', '6423', 'c', 'W', 'R', '8665', '2377', '1579', 'J', 'z', 'f', 'r']