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: Consider Input: 15, 21, ['w', 'R', '9247', '5745', '5397', 'U', 'R', 'e', '8067', 'e', '2851', 'O', 'F', '4705', '5393', 'q', 'b', 'J', '211', '4319', 'o', 'h', 'Z', '4423', 'j', '2691', 'U']

Output: 9923


Input: Consider Input: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']

Output: 28546


Input: Consider Input: 2, 4, ['1177', '9963', '395', 'r', 'T']


Output: 10358