Problem: Of course, many of you can calculate φ(n) — the number of positive integers that are less than or equal to n, that are coprime with n. But what if we need to calculate φ(φ(...φ(n))), where function φ is taken k times and n is given in the canonical decomposition into prime factors? 

You are given n and k, calculate the value of φ(φ(...φ(n))). Print the result in the canonical decomposition into prime factors.

Input

The first line contains integer m (1 ≤ m ≤ 105) — the number of distinct prime divisors in the canonical representaion of n.

Each of the next m lines contains a pair of space-separated integers pi, ai (2 ≤ pi ≤ 106; 1 ≤ ai ≤ 1017) — another prime divisor of number n and its power in the canonical representation. The sum of all ai doesn't exceed 1017. Prime divisors in the input follow in the strictly increasing order.

The last line contains integer k (1 ≤ k ≤ 1018).

Output

In the first line, print integer w — the number of distinct prime divisors of number φ(φ(...φ(n))), where function φ is taken k times.

Each of the next w lines must contain two space-separated integers qi, bi (bi ≥ 1) — another prime divisor and its power in the canonical representaion of the result. Numbers qi must go in the strictly increasing order.

Examples

Input

1
7 1
1


Output

2
2 1
3 1


Input

1
7 1
2


Output

1
2 1


Input

1
2 100000000000000000
10000000000000000


Output

1
2 90000000000000000

Note

You can read about canonical representation of a positive integer here: http://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic.

You can read about function φ(n) here: http://en.wikipedia.org/wiki/Euler's_totient_function.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int MaxP = 1000001, MaxN = 78498;
char not_prime[MaxP];
int tot, prime[MaxP], pid[MaxP], fac[MaxP];
std::vector<std::pair<int, long long> > vec[MaxN];
long long k, ans[MaxN];
void linear_sieve(int n) {
  for (int i = 2; i <= n; ++i) {
    if (!not_prime[i]) {
      pid[i] = tot;
      prime[tot++] = i;
      fac[i] = i;
    }
    for (int j = 0; j != tot; ++j) {
      long long t = 1ll * i * prime[j];
      if (t > n) break;
      not_prime[t] = 1;
      fac[t] = prime[j];
      if (i % prime[j] == 0) break;
    }
  }
}
void insert_range(int p, std::pair<int, long long> r) {
  if (r.first >= k) {
    ans[p] += r.second - r.first;
    return;
  }
  for (auto it = vec[p].begin(); it != vec[p].end();) {
    if (it->second >= r.first && r.first >= it->first) {
      r.second = it->second + r.second - r.first;
      r.first = it->first;
      it = vec[p].erase(it);
    } else if (r.second >= it->first && it->first >= r.first) {
      r.second += it->second - it->first;
      it = vec[p].erase(it);
    } else
      ++it;
  }
  vec[p].push_back(r);
}
int main() {
  int n;
  std::scanf("%d", &n);
  linear_sieve(1000000);
  for (int i = 0; i != n; ++i) {
    int p;
    long long a;
    std::scanf("%d %I64d", &p, &a);
    vec[pid[p]].push_back(std::pair<int, long long>(0, a));
  }
  std::scanf("%I64d", &k);
  for (int i = tot - 1; i >= 0; --i) {
    if (vec[i].empty()) continue;
    sort(vec[i].begin(), vec[i].end());
    for (std::pair<int, long long> r : vec[i]) {
      if (r.second > k) {
        ans[i] += r.second - k;
        r.second = k;
      }
      for (int p = prime[i] - 1; p != 1; p /= fac[p])
        insert_range(pid[fac[p]],
                     std::pair<int, long long>(r.first + 1, r.second + 1));
    }
  }
  int cnt = 0;
  for (int i = 0; i != tot; ++i)
    if (ans[i]) ++cnt;
  std::printf("%d\n", cnt);
  for (int i = 0; i != tot; ++i)
    if (ans[i]) std::printf("%d %I64d\n", prime[i], ans[i]);
  return 0;
}