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, ['3087', '7917', 'M', '4557', '4409', 'N', '1843', 's', '1883', 'L', '315', '9983', 'n', 'H', 't', '4419']
[EX A]: 4409

[EX Q]: 1, 2, ['E', 'z']
[EX A]: 0

[EX Q]: 18, 19, ['5755', 'h', '8857', 'l', '5163', 'D', 'i', '7539', 'w', '2387', '4605', 'd', 'T', 'b', '6637', '2897', '889', '7511', '1223', '6469', '2929', 'h', '6479']
[EX A]:
8734