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, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']

Ex Output:
0


Ex Input:
4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']

Ex Output:
3201


Ex Input:
9, 10, ['n', 'N', '9793', 'W', '1569', '6449', '6551', '5', '8737', '3521', 'n', 'x', 'l', '8047', 'T', 'l', 'e', 'd', 'd', '7641', '6783', 'S', '4439', '8917']

Ex Output:

12258