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: 21, 24, ['6903', '3349', '4585', 'C', 'w', 'I', 'U', 'n', '2689', 'W', '6601', '7357', '5063', 'y', '5779', 'L', '4257', 'd', '653', 'k', '8349', 'r', 'Y', '3019', 'E', '797', 'm']

Output: 11368


Input: Consider Input: 7, 19, ['6719', 'c', 'S', '3259', '1287', 'u', '9251', '2183', '4821', '9449', 'I', 'P', 'i', '7597', '8141', 'G', 'j', '8587', '7245', 'G', 'O', 'o', '9479']

Output: 57274


Input: Consider Input: 16, 23, ['N', '8323', '7039', '2941', '8459', '4529', 'I', 'V', 'V', '7929', 'L', 'b', 'x', '6793', '19', '6443', 'i', 'j', 'U', '1183', '2679', 'Q', 'l', 'f', '841']


Output: 10305