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]: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
[EX A]: 0

[EX Q]: 13, 15, ['h', 'r', '547', 'y', 'Y', '5477', '9033', '7997', 'y', '8887', 'x', 'M', '5499', '3339', '421', 'j', '2979', 'k', '2545', '5403', 'u', 'c', '8897', '755', '8539', 'U', 'd']
[EX A]:
9259