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]: 15, 21, ['w', 'R', '9247', '5745', '5397', 'U', 'R', 'e', '8067', 'e', '2851', 'O', 'F', '4705', '5393', 'q', 'b', 'J', '211', '4319', 'o', 'h', 'Z', '4423', 'j', '2691', 'U']
[EX A]: 9923

[EX Q]: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']
[EX A]: 695

[EX Q]: 16, 19, ['9979', 'd', 'Y', '4089', 'P', 'e', '451', '4155', 'l', '2867', '8505', '3757', 'g', 'F', '3065', '3007', '2633', 'u', 'l', '9299', 'u', '3255', '3403']
[EX A]:
5640