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, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']

Ex Output:
13650


Ex Input:
3, 4, ['L', 'D', 'T', 'b', 'i', 'X', '7319', '8655', '3183', '1833']

Ex Output:
0


Ex Input:
7, 8, ['9849', 'H', 't', '3187', '1403', '7091', 'F', '101', 'H', '4493', 'A', '7103', '6515', '6515', '6331', 'a', '1565', '1341', 'N', '4471', '6611', '8101']

Ex Output:

101