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.

[Q]: 6, 14, ['707', 'L', '8503', 'x', 'Y', '921', '8415', '6449', '5711', 'd', '591', 'd', '3827', '5569', 'g', 'U', 'v', '7781', 'E', 'z', '4751', '8541', 'c', 'P', '8037', 'X']
[A]: 31483


[Q]: 1, 1, ['1449', '1257']
[A]: 1449


[Q]: 5, 12, ['n', '3017', 'u', '5649', 'e', 'J', '7065', '2695', 'n', 'z', '3999', 'e', 'b', '3375', '2637', '4825', 'm', 'p', 'h', 'H']
[A]:
13759