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]: 2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']
[EX A]: 47279

[EX Q]: 2, 14, ['3199', 'o', 'v', '1631', '4791', 'X', '2405', 'y', 'P', '2013', 'M', 'l', 'Y', 'w', '9067']
[EX A]:
10840