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]: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']
[EX A]: 26471

[EX Q]: 1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']
[EX A]: 25374

[EX Q]: 14, 27, ['4503', 'q', '6711', '85', 'L', '1015', 'i', 'z', '9015', '7231', '8825', 'P', '2145', 'A', '6345', '1789', 'j', '1019', 'T', '4147', 'W', '4261', '9025', 'N', 'n', 'V', 'h']
[EX A]:
26586