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, 5, ['V', '9481', '9901', '7235', '5281', '2719']

Ex Output:
31898


Ex Input:
1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Ex Output:
0


Ex Input:
11, 13, ['3647', '211', 'u', '2481', 'r', 'D', '7529', '5953', 'N', 'i', '2519', 'E', '1039', '497', '6483', 'J', '8791', '441', 'A', '6671', 'D', '8009', '9373', '2151', 'E', 'Z', 'R', 'd']

Ex Output:

3558