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, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']

Ex Output:
5085


Ex Input:
2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

Ex Output:
12269


Ex Input:
16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']

Ex Output:

0