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]: 7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']
[EX A]: 6189

[EX Q]: 9, 11, ['8449', 'j', '8735', '2839', '2773', '1659', 'V', 'I', 'x', 'V', 't', '7837', 'F', 'N', '4179', 'G', 'f', '8193']
[EX A]: 0

[EX Q]: 5, 10, ['c', 'Q', '2003', '9845', '9191', 'm', '7793', 'D', '6893', '3903', 'r', 'Y', 'V', '243', '8087', 'D', '1579', '4083', '5681', 'f']
[EX A]:
27780