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:
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:
4, 12, ['k', '7775', '1099', '1507', '7609', 'X', 'O', '521', 'u', 'V', 't', '1935', '8171', '2063', 'h', '2961', 'z', '4955', '1359', 'm', '2137']

Ex Output:
11572


Ex Input:
7, 21, ['9', '8741', 'a', 'y', 'S', 'Q', '9701', 'q', '849', '527', 'g', 'd', '3681', 'f', '1477', 'W', '8359', '9791', '7673', '2925', '4353', 'z', 'X', '25', 'I', 'E', '7293']

Ex Output:

49336