The number of derangements of $n$ items (permutations where no element is in its original position) satisfies: $D(n) = (n-1)[D(n-1) + D(n-2)]$ with $D(0) = 1, D(1) = 0$. Compute $D(3)$.