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]: 2, 25, ['R', 'g', '5585', '1059', '3917', '8711', 'K', 'C', 'o', '4587', '7493', 'P', 'B', '5951', 'd', 'b', 'B', '851', 'S', '4589', 'P', '1471', 'Z', 'x', '9477']
[EX A]: 53691

[EX Q]: 1, 6, ['c', '7209', 'z', 'P', '2137', '2809', '6591', '269', 'd', 'y', 'e', 'j', '7945', '7639', '1971', 'Y', 'h', '513', 'z', '9873', 'Y', '4991', '8085', '3531', '457']
[EX A]:
12155