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: 13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']
Example Output: 14716

Example Input: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
Example Output: 22725

Example Input: 2, 21, ['7753', '4315', '7527', 'R', 'W', 'a', '3983', 'w', 'F', '8967', 's', 'Y', 'D', 'I', '5305', '2535', 'u', '135', 'M', 'D', 'G', 't', 'r', 'g', 'W', 'V', '3461', 'P', 'T', 'd']
Example Output:
32767