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, 9, ['b', 'W', 'S', 'U', 'u', 'v', 'S', '5255', '3899', 'a', '307', 'd', '6369', '7113', '6545', 'Q', 'y', '4551', '4337', 'M', '3707', '6745', '8001', '8703', '5611', '1917', 'S', '5353']