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: 2, 2, ['8149', '7123', 'c', 'X', '1659']

Output: 7123


Input: Consider Input: 1, 2, ['4857', '6373']

Output: 11230


Input: Consider Input: 5, 12, ['P', 'B', 'B', '1881', 'O', '2405', '9265', '7263', '1555', 'Q', 'k', 'p', 'o', 'H', 'z', '1639']


Output: 20488