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]: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']
[EX A]: 27156

[EX Q]: 3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']
[EX A]: 4295

[EX Q]: 10, 22, ['3083', '8301', '1587', '6643', 'H', '9727', 't', '3131', 'x', 'y', '9649', '1679', '245', '5215', '6703', '7949', '3995', '4953', 't', '8079', '1361', 'G', '1341']
[EX A]:
49828