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, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
[EX A]: 7479

[EX Q]: 6, 7, ['m', 'r', 'B', 'x', 't', 'k', 'A', 'V', 'W', '7007', 'K', 'J', 'F', '8517', '8471', 'r', 'Q', '5043', 'W']
[EX A]:
0