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]: 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']
[A]: 72398


[Q]: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']
[A]: 26471


[Q]: 13, 21, ['4171', 'n', '7521', '2575', 'e', 'r', 'U', '4033', 'h', 'Y', 'K', 'b', 'l', 'K', '3233', '7401', '6089', '8617', 'd', '6141', '5333', '9413', '9375', 'w', 'i']
[A]:
36814