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, 3, ['f', 'C', 'f', 'V', 't', 'x']

Ex Output:
0


Ex Input:
10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']

Ex Output:
36593


Ex Input:
5, 15, ['J', 'O', 'f', 'e', 'i', 'o', '2007', '9423', 'E', '5065', '3583', '2193', 'N', 'D', 'V', 'L', 'K', 't', '1995', '9417']

Ex Output:

22271