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]: 3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']
[A]: 38666


[Q]: 1, 1, ['2821', '3823', '9741', 'k', 'X', '2457']
[A]:
2821