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]: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']
[EX A]: 12782

[EX Q]: 1, 4, ['H', 'V', 'w', '4621', 'C', '3763', '1271', '967']
[EX A]: 4621

[EX Q]: 5, 21, ['g', '6479', 'J', '1569', 'L', '6509', '7709', 'C', 'i', '4111', 'W', '6051', 'b', 'r', '2913', '8793', 'y', 'i', '4431', 'J', 'h', '1509', 'j', '8455']
[EX A]:
40517