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, 13, ['8179', '2435', 'w', '6965', '2003', 'c', '2091', 'w', '225', 's', 'k', '4281', '1931', '3351', 'o', 'f', 'Y', 'm', '8223', 'X', 'H', 'X']
[EX A]: 10531

[EX Q]: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']
[EX A]: 28268

[EX Q]: 8, 16, ['Z', 'z', 'S', 'V', '1997', '1157', '267', 'o', '1483', 'g', '4813', 'T', 'Q', 'O', 'm', 'Z', 'z', 'H', 'M']
[EX A]:
6296