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]: 9, 9, ['G', '9137', 'G', '2393', '9383', 'r', '6897', '547', 'W', 'h', 'p', '4557']
[EX A]: 0

[EX Q]: 4, 5, ['2167', '7427', 'i', '7289', 'I', '3935', 'o', '6443', 'T', 'e', 'K', '2979', '2025', '5819']
[EX A]: 7289

[EX Q]: 3, 13, ['A', '3427', 'F', '5331', 'I', '2625', '3535', 'V', 'v', '3927', '8345', 'q', '241', '159', '1881', 'W', '5507', 'W', 'x', '5203', '5749']
[EX A]:
24004