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:
9, 9, ['V', 'x', '3763', '8367', '3369', '6695', 'p', 'P', 'L', 'g', 's', '5117', 'n', '5097', '2407', '6337', '5437', 'o', '3023', 'D', 'g']

Ex Output:
0


Ex Input:
19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']

Ex Output:
7371


Ex Input:
22, 25, ['2987', '8981', '5445', 'Q', '8655', '8075', '9141', 'S', 'n', 'r', 'j', '255', '7581', '9985', 'Q', 'Y', '5753', 'c', 't', '6905', 'u', '2613', 'E', '1815', 'a']

Ex Output:

4428