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, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']
[EX A]: 28268

[EX Q]: 1, 3, ['m', '6287', '41', 'W', '9113', 'P', 'w', 'H', '1651', '8837', '1907', 'e', 'N', 'q', 'j', 'd', 'c', '2459', '6635']
[EX A]: 6328

[EX Q]: 8, 16, ['8489', 'I', 'g', 'T', 'h', '4143', 'E', '5727', 'P', '7031', 'L', '7755', '7285', 'H', '2095', 'G', 'W', '7333', '9267', '8875', 'M', '5783']
[EX A]:
29893