CF685A.Robbers' watch

Robbers, who attacked the Gerda's cab, are very successful in covering from the kingdom police. To make the goal of catching them even harder, they use their own watches.

First, as they know that kingdom police is bad at math, robbers use the positional numeral system with base 7. Second, they divide one day in n hours, and each hour in m minutes. Personal watches of each robber are divided in two parts: first of them has the smallest possible number of places that is necessary to display any integer from 0 to n - 1, while the second has the smallest possible number of places that is necessary to display any integer from 0 to m - 1. Finally, if some value of hours or minutes can be displayed using less number of places in base 7 than this watches have, the required number of zeroes is added at the beginning of notation.

Note that to display number 0 section of the watches is required to have at least one place.

Little robber wants to know the number of moments of time (particular values of hours and minutes), such that all digits displayed on the watches are distinct. Help her calculate this number.

抢劫者袭击了格尔达的马车，他们非常擅长躲避王国警察的追捕。为了使警察抓捕他们的难度进一步加大，他们使用自己特制的手表。

首先，由于抢劫者知道王国警察不擅长数学，他们采用以 $7$ 为底的进位制（即七进制）。其次，他们将一天划分为 $n$ 小时，每小时划分为 $m$ 分钟。每位抢劫者的手表分为两部分：第一部分用于显示小时数，其位数取能表示从 $0$ 到 $n-1$ 中任意整数所需的最小位数；第二部分用于显示分钟数，其位数取能表示从 $0$ 到 $m-1$ 中任意整数所需的最小位数。最后，若某个小时数或分钟数在七进制下所需位数少于手表对应部分的位数，则需在该数的七进制表示前补足相应个数的零（即左补零）。

注意：为表示数字 $0$，手表对应部分至少需要一位。

一名小抢劫者想知道：有多少个不同的时刻（即特定的小时与分钟组合），使得手表上显示的所有数字互不相同？请帮她计算这个数目。

The first line of the input contains two integers, given in the decimal notation, n and m (1 ≤ n, m ≤ 109) — the number of hours in one day and the number of minutes in one hour, respectively.

输入的第一行包含两个十进制表示的整数 $n$ 和 $m$（$1 \leq n, m \leq 10^9$），分别表示一天中的小时数和一小时中的分钟数。

Print one integer in decimal notation — the number of different pairs of hour and minute, such that all digits displayed on the watches are distinct.

以十进制输出一个整数——满足手表上显示的所有数字互不相同的小时与分钟的不同配对数量。

In the first sample, possible pairs are: (0: 1), (0: 2), (1: 0), (1: 2).

In the second sample, possible pairs are: (02: 1), (03: 1), (04: 1), (05: 1), (06: 1).

在第一个样例中，可能的数对为：$(0: 1)$、$(0: 2)$、$(1: 0)$、$(1: 2)$。

在第二个样例中，可能的数对为：$(02: 1)$、$(03: 1)$、$(04: 1)$、$(05: 1)$、$(06: 1)$。