#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


// \sum[1<=i<=N] floor(N/i)
__int128 Sigma0(unsigned long long N) {
  if (N == 0) return 0;
  const unsigned long long N2 = sqrt(static_cast<long double>(N));
  unsigned long long N3 = cbrt(static_cast<long double>(N));
  for (; static_cast<unsigned __int128>(N3) * N3 * N3 < N; ++N3) {}
  for (; static_cast<unsigned __int128>(N3) * N3 * N3 > N; --N3) {}
  __int128 sum = 0;
  // \sum[1<=y<=floor(N^(1/2))] floor(N/y)
  using Pt = pair<unsigned long long, unsigned long long>;
  // { (x, y) | x y > N }: convex region
  auto inside = [&](unsigned long long x, unsigned long long y) -> bool {
    return (static_cast<unsigned __int128>(x) * y > N);
  };
  // -(slope at x) <= p.y/p.x
  auto steep = [&](unsigned long long x, const Pt &p) -> bool {
    return (static_cast<unsigned __int128>(N) * p.first <= static_cast<unsigned __int128>(p.second) * x * x);
  };
  vector<Pt> stack{{1, 0}, {1, 1}};
  // (x, y): inside
  unsigned long long x = N / N2, y = N2 + 1;
  for (; ; ) {
    Pt l = stack.back();
    stack.pop_back();
    for (; inside(x + l.first, y - l.second); x += l.first, y -= l.second) {
      // (x, y) -> (x + l.x, y - l.y)
      // sum for [y - l.y, y)
      sum += x * l.second + (l.first - 1) * (l.second + 1) / 2;
    }
    if (y <= N3) break;
    Pt r = l;
    for (; l = stack.back(), !inside(x + l.first, y - l.second); stack.pop_back()) r = l;
    // (x, y) + l: inside, (x, y) + r: outside
    for (; ; ) {
      const Pt m(l.first + r.first, l.second + r.second);
      if (inside(x + m.first, y - m.second)) {
        stack.push_back(l = m);
      } else {
        if (steep(x + m.first, l)) break;
        r = m;
      }
    }
  }
  for (; --y; ) sum += N / y;
  return 2 * sum - N2 * N2;
}

////////////////////////////////////////////////////////////////////////////////


constexpr int LIM_SIEVE = 100'000'000;
constexpr int LIM_SIEVE_PI = 6'000'000;
int lpf[LIM_SIEVE + 1];
int primesLen;
int primes[LIM_SIEVE_PI];
char moe[LIM_SIEVE + 1];
int fs[LIM_SIEVE + 1];
void sieveInit(int N) {
  fill(lpf, lpf + (N + 1), 0);
  primesLen = 0;
}
void sieve(int N) {
#ifdef LOCAL
  sieveInit(N);
#endif
  moe[1] = 1;
  fs[1] = 1;
  for (int n = 2; n <= N; ++n) {
    if (lpf[n] == 0) {
      lpf[n] = n;
      moe[n] = -1;
      primes[primesLen++] = n;
      fs[n] = 2;
    }
    for (int i = 0; i < primesLen && primes[i] <= lpf[n] && primes[i] * n <= N; ++i) {
      const int p = primes[i];
      const int nn = p * n;
      lpf[nn] = p;
      if (p == lpf[n]) {
        moe[nn] = 0;
        int e = 1;
        int m = n;
        do { ++e; m /= p; } while (m % p == 0);
        fs[nn] = (e + 1) * fs[m];
      } else {
        moe[nn] = -moe[n];
        fs[nn] = 2 * fs[n];
      }
    }
  }
}

Int gs[32'000'000];

__int128 s1(Int n) {
  return (__int128)n * (n + 1) / 2;
}

int main() {
  Int N;
  int M;
  for (; ~scanf("%lld%d", &N, &M); ) {
    const int sqrtN = sqrtl(N);
    sieve(sqrtN);
cerr<<"|primes| = "<<primesLen<<endl;
cerr<<"fs = ";pv(fs,fs+31);
cerr<<COLOR("95")<<__LINE__<<": "<<clock()<<COLOR()<<endl;
    
    Mint ans[2] = {};
    {
      for (int n = 1; n <= sqrtN; ++n) fs[n] += fs[n - 1];
      for (int a = 1; a <= sqrtN; ++a) if (moe[a]) {
        const Int n = N / ((Int)a * a);
        Int sum;
        if (n <= sqrtN) {
          sum = fs[n];
        } else {
          sum = Sigma0(n);
        }
        ans[0] += moe[a] * sum;
      }
cerr<<COLOR("95")<<__LINE__<<": "<<clock()<<COLOR()<<endl;
    }
    if (M) {
      for (int n = 1; n <= sqrtN; ++n) gs[n] = gs[n - 1] + (Int)n * (fs[n] - fs[n - 1]);
cerr<<COLOR("95")<<__LINE__<<": "<<clock()<<COLOR()<<endl;
      for (int a = 1; a <= sqrtN; ++a) if (moe[a]) {
        const Int n = N / ((Int)a * a);
        __int128 sum;
        if (n <= sqrtN) {
          sum = gs[n];
        } else {
          sum = 0;
          const int sn = sqrtl(n);
          for (int i = 1; i <= sn; ++i) sum += i * s1(n / i);
          sum *= 2;
          sum -= s1(sn) * s1(sn);
        }
        ans[1] += moe[a] * Mint(a) * Mint(a) * (unsigned)(sum % MO);
      }
cerr<<COLOR("95")<<__LINE__<<": "<<clock()<<COLOR()<<endl;
    }
    
    ans[0] *= ans[0];
    ans[1] *= ans[1];
    printf("%u", ans[0].x);
    if (M) printf(" %u", ans[1].x);
    puts("");
  }
  return 0;
}