Flying Saucer Segments

题意翻译

有三艘飞船以 $1-2-3$ 的形式练成一条链。在飞船 $3$ 中有 $n$ 个船员，编号依次为 $1$ 到 $n$ 的整数。现在你想让这 $n$ 个船员全部转移到飞船 $1$，遵循以下规则： - 若编号为 $t$ 的船员想从飞船 $a$ 转移到飞船 $b$（当然 $a,b$ 必须相邻），必须满足条件：飞船 $a,b$ 中没有船员的编号比 $t$ 大； - 每一个船员每次只能转移到相邻的飞船，每次转移消耗 $1$ 单位的时间； - 同一时间只能有一名船员进行转移。 请求出：将 $n$ 个船员全部转移到飞船 $1$ 所需要的最小时间。 Translated by $\operatorname{Rosmarinus}$.

题目描述

An expedition group flew from planet ACM-1 to Earth in order to study the bipedal species (its representatives don't even have antennas on their heads!). The flying saucer, on which the brave pioneers set off, consists of three sections. These sections are connected by a chain: the 1-st section is adjacent only to the 2-nd one, the 2-nd one — to the 1-st and the 3-rd ones, the 3-rd one — only to the 2-nd one. The transitions are possible only between the adjacent sections. The spacecraft team consists of $ n $ aliens. Each of them is given a rank — an integer from $ 1 $ to $ n $ . The ranks of all astronauts are distinct. The rules established on the Saucer, state that an alien may move from section $ a $ to section $ b $ only if it is senior in rank to all aliens who are in the segments $ a $ and $ b $ (besides, the segments $ a $ and $ b $ are of course required to be adjacent). Any alien requires exactly $ 1 $ minute to make a move. Besides, safety regulations require that no more than one alien moved at the same minute along the ship. Alien $ A $ is senior in rank to alien $ B $ , if the number indicating rank $ A $ , is more than the corresponding number for $ B $ . At the moment the whole saucer team is in the 3-rd segment. They all need to move to the 1-st segment. One member of the crew, the alien with the identification number CFR-140, decided to calculate the minimum time (in minutes) they will need to perform this task. Help CFR-140, figure out the minimum time (in minutes) that all the astronauts will need to move from the 3-rd segment to the 1-st one. Since this number can be rather large, count it modulo $ m $ .

输入输出格式

输入格式

The first line contains two space-separated integers: $ n $ and $ m $ $ (1<=n,m<=10^{9}) $ — the number of aliens on the saucer and the number, modulo which you should print the answer, correspondingly.

输出格式

Print a single number — the answer to the problem modulo $ m $ .

输入输出样例

输入样例 #1

1 10

输出样例 #1

2

输入样例 #2

3 8

输出样例 #2

2

说明

In the first sample the only crew member moves from segment 3 to segment 2, and then from segment 2 to segment 1 without any problems. Thus, the whole moving will take two minutes. To briefly describe the movements in the second sample we will use value , which would correspond to an alien with rank $ i $ moving from the segment in which it is at the moment, to the segment number $ j $ . Using these values, we will describe the movements between the segments in the second sample: , , , , , , , , , , , , , , , , , , , , , , , , , ; In total: the aliens need 26 moves. The remainder after dividing $ 26 $ by $ 8 $ equals $ 2 $ , so the answer to this test is $ 2 $ .

题意翻译

有三艘飞船以 $1-2-3$ 的形式练成一条链。在飞船 $3$ 中有 $n$ 个船员，编号依次为 $1$ 到 $n$ 的整数。现在你想让这 $n$ 个船员全部转移到飞船 $1$，遵循以下规则： - 若编号为 $t$ 的船员想从飞船 $a$ 转移到飞船 $b$（当然 $a,b$ 必须相邻），必须满足条件：飞船 $a,b$ 中没有船员的编号比 $t$ 大； - 每一个船员每次只能转移到相邻的飞船，每次转移消耗 $1$ 单位的时间； - 同一时间只能有一名船员进行转移。 请求出：将 $n$ 个船员全部转移到飞船 $1$ 所需要的最小时间。 Translated by $\operatorname{Rosmarinus}$.