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]: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']
[EX A]: 11880

[EX Q]: 3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']
[EX A]: 22632

[EX Q]: 1, 4, ['k', '1223', '8491', 't', 'x', '8193', '2771', 'S', '1711', 'h', 'G', '3257', 'u', 'X', '9819', 'G', '9367', '5249', '439', '9571', '9893', '1931', 'Z', 'i', 'Z', 'a', '9183', '3955', '9537', 'j']
[EX A]:
9714