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.

[Q]: 16, 20, ['7527', '5121', 'Q', '4585', '9735', 'Y', 'e', 'p', '755', '8605', 'B', 'O', 'X', '3887', 'M', '8347', '2391', 'v', 'F', '5509', 'e', 'g', 'm', 'j', 'P', 'J']
[A]: 16247


[Q]: 2, 8, ['4517', 'w', '9145', '5477', '7679', 'j', '8603', 'z']
[A]: 30904


[Q]: 11, 20, ['7623', 'H', 'i', 'Y', '2505', 'S', '8435', 'M', 'g', 'y', 'E', '8779', '5497', 'K', '7237', '2347', '6637', 'A', '8443', '5363', 'w', '1167']
[A]:
44303