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]: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
[EX A]: 9466

[EX Q]: 2, 4, ['X', 'o', '8807', 'r', 'q', '825']
[EX A]: 8807

[EX Q]: 2, 8, ['1015', 'Y', 'V', '4425', '7089', '7377', '9175', 'P', '7021', '2131', '3231', 'f', 's', '7485', '7607', '857', 'K', '2393', 'u', '7223']
[EX A]:
28066