Horse Races

2180: Horse Races

Time Limit: 2 Sec   Memory Limit: 256 MB
Submit: 2   Solved: 1
[ Submit][ Status][ Web Board]

Description

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya likes horse racing very much. Horses numbered from l to r take part in the races. Petya wants to evaluate the probability of victory; for some reason, to do that he needs to know the amount of nearly lucky horses' numbers. A nearly lucky number is an integer number that has at least two lucky digits the distance between which does not exceed k. Petya learned from some of his mates from Lviv that lucky digits are digits 4 and 7. The distance between the digits is the absolute difference between their positions in the number of a horse. For example, if k=2, then numbers 412395497, 404, 4070400000070004007 are nearly lucky and numbers 4, 4123954997, 4007000040070004007 are not.

Petya prepared t intervals [l_i,r_i] and invented number k, common for all of them. Your task is to find how many nearly happy numbers there are in each of these segments. Since the answers can be quite large, output them modulo 1000000007 (10⁹+7).

Input

The first line contains two integers t and k (1≤t,k≤1000) − the number of segments and the distance between the numbers correspondingly. Next t lines contain pairs of integers l_i and r_i (1≤l≤r≤10¹⁰⁰⁰). All numbers are given without the leading zeroes. Numbers in each line are separated by exactly one space character.

Output

Output t lines. In each line print one integer − the answer for the corresponding segment modulo 1000000007 (10⁹+7).

Examples

Input

1 2
1 100

Output

4

Input

1 2
70 77

Output

2

Input

2 1
1 20
80 100

Output

0
0

Note

In the first sample, the four nearly lucky numbers are 44, 47, 74, 77.

In the second sample, only 74 and 77 are in the given segment.

【分析】

题意很简单，找出给定区间内，4和4 , 7和7 , 4和7  间隔小于k的数字的个数。

数位dp...就是判断稍微长点，然后最后顺便判断一下l是不是答案是的话再加上，一般来说是不会t的因为只要找到符合条件的间隔之后直接标记成true后面碰到的4和7也不用再算了

【代码】

#include <iostream>
#include <cstring>
#include <string>
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
const int maxn = 1000 + 5;
int dp[maxn][maxn][2];
int bits[maxn];

int t,k;

ll dfs(int len,int lpos,int fg,bool border)
{
    if(!len) return fg == 1;
    if(!border && dp[len][lpos][fg] != -1) return dp[len][lpos][fg];
    int up = border ? bits[len] : 9;
    ll res = 0 ;
    for (int i = 0; i <= up; i ++) {
        if(i == 4 || i == 7)
        {
            res += dfs(len - 1, len, (lpos && lpos - len <= k) | fg, border && i == up);
        }
        else res += dfs(len - 1, lpos, fg, border && i == up);
    }
    res %= mod;
    if(!border) dp[len][lpos][fg] = res;
    return res;
}
ll f(string s)
{
    int len = 0;
    for (int i = s.size() - 1; i >= 0; i --) {
        bits[++ len] = s[i] - '0';
    }
    return dfs(len,0,0,1);
}
bool check(string &s)//
{
    int p = 0;
    for (int i = 1; i <= s.size(); i ++) {
        if (s[i - 1] == '4' || s[i - 1] == '7') {
            if(!p || i - p > k) p = i;
            else if(i - p <= k) return true;
        }
    }
    return false;
}

int main()
{
    cin >> t >> k;
    string l,r;
    memset(dp, -1, sizeof(dp));
    for (int i = 0; i < t; i ++) {
        cin >> l >> r;
        ll ans = f(r) - f(l) + (check(l) ? 1 : 0);
        cout << (ans % mod + mod) % mod << endl;//
    }
    return 0;
}