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]: 4, 6, ['c', 'I', 'O', 'q', 'W', 'w', '7245', '4329', '3833', 'v', 'p', 'V', '5311', 'x', '3971', 't', '8157', '1803']
[EX A]: 0

[EX Q]: 4, 5, ['677', '5585', 'W', 'J', 'C']
[EX A]: 0

[EX Q]: 1, 15, ['o', '4469', 'S', 'r', 'c', 'w', 'b', 'Q', 'S', 'M', '4001', 'h', '8285', 'Y', 'R', '9461', 'N', 'j', '2187', '431', '5895', '7395', '9041']
[EX A]:
16755