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]: 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

[EX Q]: 9, 15, ['9375', '9663', 'i', '9607', '4257', '9757', 'r', '937', 'm', 's', '9193', '2269', '4627', '2051', '7045']
[EX A]: 25185

[EX Q]: 5, 8, ['8353', 'R', '3447', 'z', '287', 'K', 'u', 'm', '8745', 'L', 'V', 'X', 'l']
[EX A]:
287