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]: 9, 16, ['v', '5691', '4973', 'J', 'w', '539', '6957', '9953', 'L', 'c', '5879', 'b', 'g', '6681', 'C', '753', '5835', '1023', 'w', '5713', '159', 'X', 'z', 'i', '8379', '9753', '195', 'X']
[EX A]: 13313

[EX Q]: 14, 15, ['Q', '2131', 'X', 'u', 'y', '9699', '7305', '3017', '8151', 'X', '9723', '7907', 'j', '1527', 'u', 'D', 'b', '7735', '1713']
[EX A]: 1527

[EX Q]: 13, 15, ['6429', 'd', '4359', '1815', '5429', '7139', '8761', 'W', '6903', '5957', 'Y', '6101', 'p', '2437', '7247', '5891', 'b', '3273', 'U', 'h', 'a', 'A', 't', 'V']
[EX A]:
9684