[{"sectionTitle":"题目描述","type":"Text","text":"由于科协里最近真的很流行数字游戏，某人又命名了一种取模数，这种数字必须满足各位数字之和 $\\bmod N$ 为 $0$。现在大家又要玩游戏了，指定一个整数闭区间 $[a,b]$，问这个区间内有多少个取模数。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"题目有多组测试数据。每组只含三个数字 $a, b, N$。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"对于每个测试数据输出一行，表示各位数字和 $\\bmod N$ 为 $0$ 的数的个数。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["1 19 9","2"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于全部数据，$1\\le a,b\\le 2^{31}-1,1\\le N\\lt 100$。","subType":"markdown"}]