Problem: 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 [li, ri] 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 (109 + 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 li and ri (1 ≤ l ≤ r ≤ 101000). 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 (109 + 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int M = 1005;
const int MOD = 1e9 + 7;
int read() {
  int x = 0, f = 1;
  char c;
  while ((c = getchar()) < '0' || c > '9') {
    if (c == '-') f = -1;
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
int T, n, k, a[M], dp[M][M][2];
char s[M];
int dfs(int x, int d, int q, int up) {
  if (!x) return q;
  if (!up && dp[x][d][q] != -1) return dp[x][d][q];
  int ans = 0;
  for (int i = 0; i <= 9; i++) {
    if (up && i > a[x]) break;
    if (i == 4 || i == 7)
      ans = (ans + dfs(x - 1, k, q || d, up && (i == a[x]))) % MOD;
    else
      ans = (ans + dfs(x - 1, max(d - 1, 0), q, up && (i == a[x]))) % MOD;
  }
  if (!up) dp[x][d][q] = ans;
  return ans;
}
int work() {
  scanf("%s", s);
  n = strlen(s);
  for (int i = 0; i < n; i++) a[n - i] = s[i] - '0';
  return dfs(n, 0, 0, 1);
}
int check() {
  int last = 3000, f = 0;
  for (int i = n; i >= 1; i--) {
    if (a[i] == 4 || a[i] == 7) {
      if (last - i <= k) f = 1;
      last = i;
    }
  }
  return f;
}
int main() {
  memset(dp, -1, sizeof dp);
  T = read();
  k = read();
  while (T--) {
    int l = work() - check(), r = work();
    printf("%d\n", (r - l + MOD) % MOD);
  }
}