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, 11, ['L', 'Z', '4501', '4131', 'a', '8057', 'K', 'P', '4713', '8889', 'b', '3927', 'k', '6005', 'T', 'w', 'S', '3963', '2727']
[EX A]: 8889

[EX Q]: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']
[EX A]: 4452

[EX Q]: 4, 5, ['5545', '3265', '2901', '6053', '4649', 'v', '1225', 'K', '4055']
[EX A]:
10702