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 Q]: 19, 23, ['8277', '3337', 'G', 'N', '2365', 'S', 'Y', 'l', '5871', '2373', '7441', '2095', 'N', 'J', 'Q', '5493', 'Q', 'g', 'E', 'i', '4825', '5543', 'i', '1737', 'y', '1463', 'r', 'F']
[EX A]: 10368

[EX Q]: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
[EX A]: 24200

[EX Q]: 1, 6, ['8527', '3499', 'M', 'f', 'V', 'B']
[EX A]:
12026