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, 11, ['8237', '8149', '7077', '2199', '7839', 'c', 'j', 'Y', '845', '2273', 'n', 'Q']
[EX A]: 28382

[EX Q]: 2, 5, ['8407', '1329', '2243', '2547', '5371', '6023', '7139', 'K', '339', '3301', '6771', 'Z', '9983', '17', 'V']
[EX A]: 11490

[EX Q]: 2, 2, ['8511', '4711', '9983', 'j', 'P', 'U', 'O', 'M', '8607', '1433', '9995', '2549', '7177', 'r', 'V', '7101', '9627', '7673', '9901', '751', '4935', '6435', '2765']
[EX A]:
4711