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: 3, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']

Output: 20895


Input: Consider Input: 1, 4, ['o', 'O', '7355', 'S', '2513', 'f', '4189']

Output: 7355


Input: Consider Input: 7, 14, ['8439', 'r', '2181', 'b', '657', '3463', '5043', 'h', '7553', 'C', '1961', 'J', '309', 'o', '6823', '639', '4213', '6891', 'p', '5847', '421', 'i', 'c', '7521', '6773', 'L', 'N', 'r', '797']


Output: 14866