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]: 1, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']
[EX A]: 19785

[EX Q]: 2, 21, ['7753', '4315', '7527', 'R', 'W', 'a', '3983', 'w', 'F', '8967', 's', 'Y', 'D', 'I', '5305', '2535', 'u', '135', 'M', 'D', 'G', 't', 'r', 'g', 'W', 'V', '3461', 'P', 'T', 'd']
[EX A]: 32767

[EX Q]: 10, 13, ['W', '5479', 'v', '2193', '8465', '3805', 'e', '7721', '983', 'i', '7843', '6803', '9901', 'K', '375', '165', 'M', 'P', 'a', 'J']
[EX A]:
24547