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: 17, 21, ['7037', '9447', 'f', 'R', '1237', '5735', '1327', '1371', 'd', '3025', 'B', '9165', '3447', '6135', '3315', 'l', '8069', 'g', 'H', 'e', '4523', '3149', 'H', 'o', '3947']

Output: 12592


Input: Consider Input: 4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']

Output: 10432


Input: Consider Input: 6, 12, ['3679', '6737', '3629', '1609', 'L', '9431', '909', '4153', '8941', 'e', 'm', 'i', '6415', 'C', '8473', '8609', '227', 'H', 'h', 'r', '6291', 'y', '4439', 'E']


Output: 23434