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, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']
[EX A]: 15061

[EX Q]: 2, 2, ['8149', '7123', 'c', 'X', '1659']
[EX A]: 7123

[EX Q]: 7, 9, ['A', '4409', 'B', '7851', '4681', '8427', '8815', 'g', '179', 'X']
[EX A]:
8994