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:
4, 4, ['2107', 'l', '7551', '4907']

Ex Output:
4907


Ex Input:
1, 6, ['u', 'L', 'm', '9283', 'e', '4615', '7815', '7185', 'h', 'h', '8985', '3987', '1521', 'k', '5715', 'd', 'w', 'T']

Ex Output:
13898


Ex Input:
3, 20, ['2387', 'Z', 'L', 'c', 'N', '309', 'E', '5773', '8581', '9507', 'g', '8583', 'z', 'R', 'n', '2259', '2935', '7671', 'S', 'D', 'Z', 'E', 'y', '5727', '6615', 'x', '3695']

Ex Output:

45618