#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { long long l, r, k; int c; cin >> l >> r >> k >> c; auto calc = [&](int x)->long long { int s = x / k; long long ret = 0; long long pw = 1; rep(i, 9) { ret += floor_sum(s + 1, pw * 10, k, pw * (10 - c)); ret -= floor_sum(s + 1, pw * 10, k, pw * (10 - c - 1)); pw *= 10; } return ret; }; long long ans = calc(r) - calc(l - 1); cout << ans << endl; } return 0; }