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, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']

Ex Output:
8886


Ex Input:
5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']

Ex Output:
17181


Ex Input:
4, 9, ['A', 'j', 'M', 'q', '4839', 'R', '9409', '7185', 'l', '7363', 'Y', '6939']

Ex Output:

21433