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, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']

Output: 4383


Input: Consider Input: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']

Output: 14032


Input: Consider Input: 1, 14, ['5151', 'L', 'R', 'R', 'm', '7599', '7837', 'S', 'c', '343', '2205', '925', 'M', '7121', '987', 'P']


Output: 31181