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]: 12, 16, ['J', 'B', '4463', 'b', 'o', '5495', 'S', '7657', 'Y', '4805', 'h', 'f', '9743', 'A', '1167', 'W', 'y', 's', '529', '2899', 't', '5111', '3615', '217', '799', '2761', 'V', '3491', '7621', 'R']
[EX A]: 10910

[EX Q]: 3, 4, ['u', '5041', 'E', 'U', 'a', 'd']
[EX A]: 0

[EX Q]: 1, 12, ['1467', 'X', '3331', 'k', '3849', 'E', 'i', 'R', '6891', 'C', '7167', '5139', 'o', 'W', 'h', '6449', '2645', 'c', 'K', 'x', '5015', '8063', '6377', '7491', 'S', '3745', '3751']
[EX A]:
27844