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:
10, 11, ['A', 'H', 's', '8033', 'M', '7393', '1231', 'T', '5025', '1739', 'q', '4233']

Ex Output:
1739


Ex Input:
3, 21, ['X', 'Z', '749', '5557', '9991', 'T', '3461', '335', 'I', 'J', '7113', 'b', '2683', '653', '3951', '4193', 'J', '7179', 'G', 'Y', '6151', '2873', 'X', '5619', '5151', '7689', '5605', 'o']

Ex Output:
52016


Ex Input:
10, 11, ['2575', 'V', 's', '3555', '7673', 'f', '781', '4933', '3703', '1755', 'x', '387', 'A', 'e', 'e', 'Z', 'f', '3181', '9635', 'A', 's', '2215', '5207', 'U', 'H', '6807', '4975', 'u']

Ex Output:

1755