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:
11, 11, ['1049', 'a', '7521', 'f', 'Z', '2973', '7245', 'e', '1807', 'e', '1325', '7327', 'r']

Ex Output:
1325


Ex Input:
5, 18, ['T', '7117', '7067', 't', '7083', '5711', '6735', 's', '4879', '2553', 'a', 'z', 'Q', '4759', '6243', 'k', 'V', '7803', '2489', 'j', '9449', '8017', '9739', 'F', '1557']

Ex Output:
45766


Ex Input:
4, 11, ['7487', 'g', '5455', '753', 'e', 'c', '4301', '8769', 'm', 'Y', 'k', '2929', '3437', 'N']

Ex Output:

13823