#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 50;
long long qpow(long long a, long long b) {
  long long ret = 1;
  b %= MOD - 1;
  a %= MOD;
  while (b) {
    if (b & 1) ret = a * ret % MOD;
    b >>= 1;
    a = a * a % MOD;
  }
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void work() {
  long long a, b;
  scanf("%lld%lld", &a, &b);
  long long ans = 0;
  int ned = 9;
  while (b >= ned) {
    ans += a;
    ned = ned * 10 + 9;
  }
  printf("%lld\n", ans);
}
int main() {
  int T;
  scanf("%d", &T);
  for (int cas = 1; cas <= T; cas++) work();
}
