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]: 2, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']
[EX A]: 27506

[EX Q]: 1, 9, ['6607', '6185', 'X', 'd', 'T', 't', 'Y', 'p', '2789', 'a', '7365', 'k', 'n', '1853', 'x', 'F', '5523', '2827', '1441', 'F', 'c', 'i', 'n', 'h', '3633']
[EX A]: 15581

[EX Q]: 5, 27, ['j', 'o', 'b', '1765', '549', 't', '3533', 'f', 'f', 'i', '1139', '399', 'a', 'o', 'A', '4395', '4431', '8273', 'T', 'F', 's', 'b', 'r', 'F', '9281', 'R', '1137', 'T']
[EX A]:
33137