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, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']

Ex Output:
27506


Ex Input:
2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

Ex Output:
10176


Ex Input:
2, 9, ['9809', '2213', '525', '8227', 'n', 'm', 'f', 's', 'o', '2995', '2039', 'A']

Ex Output:

10965