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:
2, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']

Ex Output:
34470


Ex Input:
1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']

Ex Output:
11266


Ex Input:
2, 17, ['D', '7433', 'n', '8597', 'Y', '213', 'i', 'F', 'o', 'W', '9345', 'D', 'A', 'V', 'v', '5229', '4163', 'H', '4023', 'O', '5093', '8929', 'D', 'G', '2337', 'R', '6815', 'd']

Ex Output:

34980