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]: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']
[EX A]: 36593

[EX Q]: 2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']
[EX A]: 12269

[EX Q]: 1, 2, ['8091', '8271', '117', 'X', '2493', 'z', '2353', '1715', 'N', 'R', '8999', '6317', '397', '4675', '8169', '9097', 'p', '773', '5347', '9113', '4755', '9383', '1717', 'P', 'U', 'J', '859', 'q']
[EX A]:
16362