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, 4, ['3155', '581', 'N', '153', 't', '7941', '6065']
[EX A]: 734

[EX Q]: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']
[EX A]: 1667

[EX Q]: 5, 5, ['651', 's', '6891', 'h', '3517', 'R', '381']
[EX A]:
3517