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: 5, 6, ['6675', '1045', '5697', '8385', 'R', '8979', '2187', 'L', 'w', '9711', 'e', '9789', 'f', 'c', 'C', '8189', '131', '8163']

Output: 8979


Input: Consider Input: 6, 7, ['6997', '3987', '2463', 'm', 'W', 'R', 'a', 'U', 's', 'Y', 'X', '4193', '343', 'Y', '4277', 'n', 'W']

Output: 0


Input: Consider Input: 8, 22, ['a', 'U', 'G', '1237', 'O', 't', 'i', 'G', 'K', 'n', 'm', '3781', '587', 'a', '9391', 'q', 'R', '3473', 'b', 't', 'Z', '2185', '1713']


Output: 19417