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]: 8, 26, ['n', '9063', 'c', 'k', '7515', 'm', '2261', '4297', '9817', '7599', '1669', 'l', '9837', '3021', 'Q', '3991', 'r', 'B', '8615', 'J', '5641', '7637', '469', '3571', '2265', '3969']
[EX A]: 72398

[EX Q]: 6, 12, ['q', '8055', '5233', '5529', 'T', 'h', 'w', 'w', '9449', 'W', '7903', 'b', '6925']
[EX A]: 17352

[EX Q]: 9, 11, ['9643', '5097', '429', 'F', '2011', 'f', 'l', '8779', '7607', '3457', '8271', '3435', 'S', 'e', '2141', 'R', '4979', '8963', 'v', '3923', '7209', '6557', '7973', '1913', 'M']
[EX A]:
19335