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.

Ex Input:
3, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']

Ex Output:
719


Ex Input:
18, 27, ['1757', 'B', '5165', 'v', 'c', '2699', '9861', '3935', 'p', 'A', '6855', '5233', '1543', 'A', 'H', 'o', 'P', '6749', '2411', 'B', 'U', 'G', '1645', '1543', 'x', '7271', '4383', 'n', '2725', 'n']

Ex Output:
24002


Ex Input:
10, 11, ['s', '5703', '8815', '1651', 'g', 'N', '7569', '27', 'H', '5689', 'q', '749']

Ex Output:

5689