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]: 1, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']
[EX A]: 26847

[EX Q]: 4, 13, ['5653', '9869', '5325', '7307', '5513', '2167', '2393', 'p', 'F', '2011', '5431', '2695', 'v', 'p', '3743', 'j', 'y', '5903', '5135', '467', '8443', 'C', 'i', 'w', 'y']
[EX A]: 27517

[EX Q]: 9, 18, ['e', '1139', '1855', '7791', 'P', '9519', 'y', '4117', '341', 'F', 'A', 's', 'h', '8263', '63', '3847', '4251', '5841', 'M', 'n', '8969', '8727', 'z', 'O', 'T', '8773', 'd', 'F']
[EX A]:
22606