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, 19, ['5671', '7557', '3823', '2307', '2763', 'b', 'E', '5081', '4431', '6143', '6939', '9417', '8697', '4175', 'n', '7633', '8723', 'A', '7583', '2081', '7577', '4019', 'q']
[EX A]: 85272

[EX Q]: 1, 5, ['5057', 'Z', 'a', '4561', '225', '6921', 'T', '4033', '1259', '9805', 'l', '5641']
[EX A]: 9843

[EX Q]: 16, 19, ['w', 'B', 's', '1465', 'E', '4447', 'a', '5601', '8157', '8273', 'z', '4405', '5471', 'B', '8103', 'w', '7469', 'w', '241', 'n']
[EX A]:
7710