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]: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']
[EX A]: 27156

[EX Q]: 1, 3, ['E', '6187', '5861', '3697', '2749', '1171', '6085', 'c', '2291', '2385', '7335', 'B']
[EX A]: 12048

[EX Q]: 3, 10, ['7377', 'j', '9565', '6661', '1941', 'F', '1139', 'R', 'H', '9521', '8933', '8077', '6019', 'b', 'j', '6423', 'a', '1741', '621', 'i', '2409', 'e', 'a', '7827', '5539', 'm', '401', '629', '8439']
[EX A]:
28827