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]: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
[EX A]: 0

[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]: 10, 13, ['1263', '8489', 'p', '5971', '1469', '8145', '7237', '823', '6561', 'O', '5167', '9049', 'o']
[EX A]:
14216