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]: 1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
[EX A]: 33375

[EX Q]: 3, 10, ['x', '5071', '6421', '5701', 'l', '5659', 'P', '7975', 'z', 'p', 'B', 'q', '1275', 'v', '6471', 'o', 'Q', 'F', '1845', '6063', '3277', '9039', '4209', '2869', '2293', '4517', '577', '3375']
[EX A]: 25756

[EX Q]: 3, 5, ['q', '4285', 'I', '1375', '4291', '9463', 'd']
[EX A]:
5666