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, 10, ['N', 'p', 'z', '6083', 'x', 'x', '3063', 'Y', '7099', '9961', 'k', '7365', 'e', '8629', '9595', '2831', '3649', '3809', 'm']

Ex Output:
26206


Ex Input:
10, 11, ['A', 'H', 's', '8033', 'M', '7393', '1231', 'T', '5025', '1739', 'q', '4233']

Ex Output:
1739


Ex Input:
16, 25, ['x', 'D', 'I', 'C', '3437', '1863', 'O', 'i', '9519', '989', 'R', 't', 'U', 'p', '7111', 'Z', 's', '4161', 'M', 's', '969', '2633', 'u', 'p', '5341', '3245', 'P']

Ex Output:

13104