Python 3 please

Given an array A of size n and another integer m. Now, imagine each integer in A being on the x- axis. We define a healthy subsequence to be one of the sequence selected from these n integers, such that the distance between each of the positions in the subsequence is a multiple of m (could be 0 as well). i.e. for any two indices i, j in A, to be in a healthy subset the following criteria must be met: abs (A[i] A[j]) = k * m and k could be any whole number i.e {0, 1, 2,..}