For integers 0≤m,n≤64, let α(m,n) be the number of nonnegative integers k for which ⌊m/2k⌋ and ⌊n/2k⌋ are both odd integers. Consider a 65×65 matrix M whose (i,j)th entry (for 1≤i,j≤65) is (−1)α(i−1,j−1). Compute the remainder when detM is divided by 1000. Proposed by Evan Chen