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, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']

Ex Output:
25920


Ex Input:
4, 5, ['t', '9215', 'K', 'Q', 'w']

Ex Output:
0


Ex Input:
19, 19, ['6797', 'F', '6913', '829', 'u', 'W', '7515', 'p', '9955', 'J', '1453', '4231', 'B', '7761', '9347', 'g', '4303', 'z', '7961', 'v', '5421', '7049', '2071', 'J', '3829', '8551', '1323', '5551', 'g']

Ex Output:

7961