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, 12, ['i', '35', 'v', 'G', 'o', '5861', '8371', 'P', '1895', '6183', '8025', '2455', '4763', '409', 'e', 'A', '9029', 'a', 'I', '2761', '5481', 'f', '3413', '803', 'W', 'A', '8781']
[EX A]: 18558

[EX Q]: 5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']
[EX A]: 7896

[EX Q]: 13, 13, ['7457', 'n', '207', '2661', '6973', '2689', 'P', 'f', '2051', 'S', 'r', '3853', '8031', '9945', 'h', 'v', '5495', 'P', '3089']
[EX A]:
8031