{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e \u003cspan\u003e监狱有N个房间\u003c/span\u003e(\u003cspan\u003e编号从1递增\u003c/span\u003e)(\u003cspan\u003e线性排列的\u003c/span\u003e),每个房间关押一位集训队大佬,有M种内裤,每个集训队大佬穿着其中一种。如果\u003cbr\u003e 相邻房间的集训队大佬穿的内裤相同,就可能发生越狱,求有多少种情况可能发生越狱\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e 输入两个整数M,N.1\u0026lt;\u003dM\u0026lt;\u003d10^8,1\u0026lt;\u003dN\u0026lt;\u003d10^12\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e \u003cspan\u003e可能越狱的方法数,模100003\u003c/span\u003e\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\r\n2 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\r\n6\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003cp\u003e \u003cspan\u003e6种状态为\u003c/span\u003e(000)(001)(011)(100)(110)(111)\u003c/p\u003e"}}]}