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]: 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']
[EX A]: 31483

[EX Q]: 5, 11, ['P', '8565', '3357', '1049', '9881', 'V', '2119', '2447', 'M', '8017', 'N', 'n', '3913', '4271', 't', '1585']
[EX A]: 22464

[EX Q]: 6, 10, ['k', '2525', '8245', '8709', '4185', 'T', '807', 'I', 's', 'M']
[EX A]:
807