Codeforces Round 372 (Div. 1) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

dfs and similar

divide and conquer

dsu

trees

*2700

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Digit Tree

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputZS the Coder has a large tree. It can be represented as an undirected connected graph of *n* vertices numbered from 0 to *n* - 1 and *n* - 1 edges between them. There is a single nonzero digit written on each edge.

One day, ZS the Coder was bored and decided to investigate some properties of the tree. He chose a positive integer *M*, which is coprime to 10, i.e. .

ZS consider an ordered pair of distinct vertices (*u*, *v*) interesting when if he would follow the shortest path from vertex *u* to vertex *v* and write down all the digits he encounters on his path in the same order, he will get a decimal representaion of an integer divisible by *M*.

Formally, ZS consider an ordered pair of distinct vertices (*u*, *v*) interesting if the following states true:

- Let
*a*_{1}=*u*,*a*_{2}, ...,*a*_{k}=*v*be the sequence of vertices on the shortest path from*u*to*v*in the order of encountering them; - Let
*d*_{i}(1 ≤*i*<*k*) be the digit written on the edge between vertices*a*_{i}and*a*_{i + 1}; - The integer is divisible by
*M*.

Help ZS the Coder find the number of interesting pairs!

Input

The first line of the input contains two integers, *n* and *M* (2 ≤ *n* ≤ 100 000, 1 ≤ *M* ≤ 10^{9}, ) — the number of vertices and the number ZS has chosen respectively.

The next *n* - 1 lines contain three integers each. *i*-th of them contains *u*_{i}, *v*_{i} and *w*_{i}, denoting an edge between vertices *u*_{i} and *v*_{i} with digit *w*_{i} written on it (0 ≤ *u*_{i}, *v*_{i} < *n*, 1 ≤ *w*_{i} ≤ 9).

Output

Print a single integer — the number of interesting (by ZS the Coder's consideration) pairs.

Examples

Input

6 7

0 1 2

4 2 4

2 0 1

3 0 9

2 5 7

Output

7

Input

5 11

1 2 3

2 0 3

3 0 3

4 3 3

Output

8

Note

In the first sample case, the interesting pairs are (0, 4), (1, 2), (1, 5), (3, 2), (2, 5), (5, 2), (3, 5). The numbers that are formed by these pairs are 14, 21, 217, 91, 7, 7, 917 respectively, which are all multiples of 7. Note that (2, 5) and (5, 2) are considered different.

In the second sample case, the interesting pairs are (4, 0), (0, 4), (3, 2), (2, 3), (0, 1), (1, 0), (4, 1), (1, 4), and 6 of these pairs give the number 33 while 2 of them give the number 3333, which are all multiples of 11.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/13/2024 09:21:48 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|