Recently, the authors presented different block preconditioners for implicit Runge-Kutta discretization of the heat equation. The preconditioners were block Jacobi and block Gauss-Seidel preconditoners where the blocks reused existing preconditioners for the implicit Euler discretization of the same equation. In this paper we will introduce similar block preconditioners for the implicit Runge-Kutta discretization of the Bidomain equation. We will, by numerical experiments, show the properties of the preconditoners, and that higher-order Runge-Kutta discretization of the Bidomain equation may be superior to lower-order in some cases.