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, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']

Ex Output:
32007


Ex Input:
1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']

Ex Output:
8063


Ex Input:
9, 25, ['3531', 'd', 'p', '4121', '611', '8373', '7669', 'S', 'o', '4087', 't', '5747', '3619', 'O', 'F', '4065', 'J', 'J', 'q', 'L', 'M', 'J', 'O', '7167', '3165']

Ex Output:

27850