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, 1, ['5141', 'S']

Ex Output:
5141


Ex Input:
5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

Ex Output:
4571


Ex Input:
15, 17, ['9283', '3847', '3247', 'q', 's', '4303', 'O', 'l', 'F', 'F', 'T', 'Z', '4233', 'J', 'S', '9043', '7867', '1529', '6129', 'v', '5479', '3379', '6381', 'n', 'T', 'Q', '2555']

Ex Output:

16910