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.

Input: Consider Input: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']

Output: 695


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

Output: 22725


Input: Consider Input: 2, 13, ['341', '9191', 'o', '9861', '8467', '1011', '7739', '7393', '9361', 'l', '3781', '4661', '8803', 'l']


Output: 70268