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:
3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']

Ex Output:
59155


Ex Input:
5, 9, ['X', '6543', '1123', '5967', 'x', '9197', '2865', 'r', 'V', 'c']

Ex Output:
12062


Ex Input:
1, 2, ['1659', '2871', 'm', 'r']

Ex Output:

4530