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, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']
[EX A]: 26162

[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]: 1, 8, ['R', 'K', '5119', '8629', '9895', 'r', '3125', '3773', 'k']
[EX A]:
30541