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, ['8527', '3499', 'M', 'f', 'V', 'B']
[EX A]: 12026

[EX Q]: 3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']
[EX A]: 4295

[EX Q]: 5, 14, ['49', 'g', '9363', '9299', '3829', 'f', '7609', '8687', 'U', '613', 'R', '9457', '3601', '3163', 'V']
[EX A]:
36959