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, 20, ['N', '3757', '4835', '557', 'n', '3381', '3229', '9715', 'O', 'J', '5215', 'Q', '7867', 'W', '5159', '1571', '2911', '8907', 'J', 'b']
[EX A]: 57104

[EX Q]: 2, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']
[EX A]: 4591

[EX Q]: 11, 16, ['8837', '2745', 'v', '8055', 'R', '1211', '8975', 'M', '5237', 'o', 'n', '163', '1977', 'C', 'o', 'V', '5127', 'V']
[EX A]:
2140