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:
1, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']

Ex Output:
0


Ex Input:
6, 9, ['8047', 'Q', 'A', '2811', '8953', 'P', '4515', 'f', 'K', 'u', 'g', 'R', 'p', '667', '8703', '2903', '6299', '417', '3317', 'O', 'z', '3507', '8969', '6193', '2549']

Ex Output:
4515


Ex Input:
1, 14, ['6711', 'p', '3969', '5553', 'J', '3963', '1753', 'M', 'd', 'd', '8765', 'r', 'M', 'b', '6785', 'f', '337', 'F', 'z', '1935', '9501', '2343', 'a', 'b', 'u']

Ex Output:

30714