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:
12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']

Ex Output:
22751


Ex Input:
14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']

Ex Output:
19532


Ex Input:
3, 4, ['H', '1037', '1373', 'G', 'K', 'X', 'r', '9451', '6611', 'p', 'E', 'W', '9949', 'Y', '3177', 'A', 'o', '3801', '4849', '5067', 'L', 'J', 'M']

Ex Output:

1373