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:
15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']

Ex Output:
34357


Ex Input:
13, 15, ['2609', 'D', '4725', 'R', '1199', 's', 'r', 'Y', 'v', 'm', 'a', '3557', '7179', 'V', '7649', '5095', '4819']

Ex Output:

14828