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.

Example Input: 7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']
Example Output: 6189

Example Input: 1, 11, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']
Example Output: 30927

Example Input: 3, 14, ['9399', 'N', 'p', '5867', '3363', 'l', '5621', '9087', 'n', '3443', 'K', '5403', '3511', '4213', '201', '6475', 's', '3083', 'd', '5491', 'A', 'a', 'W', '4263']
Example Output:
40508