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:
10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']

Ex Output:
11263


Ex Input:
9, 9, ['y', '689', 'X', 'X', 'u', '1839', '8779', 'O', 'O', 'A', '1559', 'A', 'U']

Ex Output:
0


Ex Input:
20, 21, ['7947', '5731', 'n', '6733', '8693', '5613', 'c', 'C', 'o', '7789', 'B', '3291', 'm', '8909', 'm', '759', '8985', 'v', '9271', '4091', 'N']

Ex Output:

4091