#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
template <typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template <typename T>
std::vector<T> readVec(const std::size_t l)
{
    std::vector<T> v(l);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F>
constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T>
bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template <typename T>
bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T popCount(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T>
constexpr T log2p1(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v);
#endif
}
template <typename T>
constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); }
template <typename T>
constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T>
constexpr T lsbp1(const T v)
{
#ifdef __has_builtin
    return __builtin_ffsll(v);
#else
    return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T>
constexpr bool ispow2(const T v) { return popCount(v) == 1; }
template <typename T>
constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); }
//!=================================================!//
//!   .88888.                             dP        !//
//!  d8'   '88                            88        !//
//!  88        88d888b. .d8888b. 88d888b. 88d888b.  !//
//!  88   YP88 88'  '88 88'  '88 88'  '88 88'  '88  !//
//!  Y8.   .88 88       88.  .88 88.  .88 88    88  !//
//!   '88888'  dP       '88888P8 88Y888P' dP    dP  !//
//!                              88                 !//
//!                              dP                 !//
//!=================================================!//
struct Graph
{
    Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}
    void addEdge(const std::size_t from, const std::size_t to, const bool bi = false)
    {
        assert(from < V), assert(to < V);
        edge[from].push_back(to), rev_edge[to].push_back(from);
        if (bi) { addEdge(to, from, false); }
    }
    const std::vector<std::size_t>& operator[](const std::size_t i) const { return assert(i < V), edge[i]; }
    friend std::ostream& operator<<(std::ostream& os, const Graph& g)
    {
        os << "[\n";
        for (std::size_t i = 0; i < g.V; i++) {
            for (const std::size_t to : g.edge[i]) { os << i << "->" << to << "\n"; }
        }
        return (os << "]\n");
    }
    std::size_t V;
    std::vector<std::vector<std::size_t>> edge, rev_edge;
};
using Tree = Graph;
//!===============================================================!//
//!   88888888b            dP       .88888.   a88888b. 888888ba   !//
//!   88                   88      d8'   '88 d8'   '88 88    '8b  !//
//!  a88aaaa    dP.  .dP d8888P    88        88        88     88  !//
//!   88         '8bd8'    88      88   YP88 88        88     88  !//
//!   88         .d88b.    88      Y8.   .88 Y8.   .88 88    .8P  !//
//!   88888888P dP'  'dP   dP       '88888'   Y88888P' 8888888P   !//
//!===============================================================!//
template <typename T>
constexpr std::pair<T, T> extgcd(const T a, const T b)
{
    if (b == 0) { return std::pair<T, T>{1, 0}; }
    const auto p = extgcd(b, a % b);
    return {p.second, p.first - p.second * (a / b)};
}
template <typename T>
constexpr T inverse(const T a, const T mod) { return (mod + extgcd((mod + a % mod) % mod, mod).first % mod) % mod; }
//!========================================================!//
//!  8888ba.88ba                 dP    dP            dP    !//
//!  88  '8b  '8b                88    88            88    !//
//!  88   88   88 .d8888b. .d888b88    88 88d888b. d8888P  !//
//!  88   88   88 88'  '88 88'  '88    88 88'  '88   88    !//
//!  88   88   88 88.  .88 88.  .88    88 88    88   88    !//
//!  dP   dP   dP '88888P' '88888P8    dP dP    dP   dP    !//
//!========================================================!//
template <uint mod>
class ModInt
{
private:
    uint v;
    static uint norm(const uint& x) { return x < mod ? x : x - mod; }
    static ModInt make(const uint& x)
    {
        ModInt m;
        return m.v = x, m;
    }
    static ModInt power(ModInt x, ll n)
    {
        ModInt ans = 1;
        for (; n; n >>= 1, x *= x) {
            if (n & 1) { ans *= x; }
        }
        return ans;
    }
    static ModInt inv(const ModInt& x) { return ModInt{inverse(static_cast<ll>(x.v), static_cast<ll>(mod))}; }

public:
    ModInt() : v{0} {}
    ModInt(const ll val) : v{norm(uint(val % static_cast<ll>(mod) + static_cast<ll>(mod)))} {}
    ModInt(const ModInt& n) : v{n()} {}
    explicit operator bool() const { return v != 0; }
    bool operator!() const { return not static_cast<bool>(*this); }
    ModInt& operator=(const ModInt& m) { return v = m(), (*this); }
    ModInt& operator=(const ll val) { return v = norm(uint(val % static_cast<ll>(mod) + static_cast<ll>(mod))), (*this); }
    friend ModInt operator+(const ModInt& m) { return m; }
    friend ModInt operator-(const ModInt& m) { return make(norm(mod - m.v)); }
    friend ModInt operator+(const ModInt& m1, const ModInt& m2) { return make(norm(m1.v + m2.v)); }
    friend ModInt operator-(const ModInt& m1, const ModInt& m2) { return make(norm(m1.v + mod - m2.v)); }
    friend ModInt operator*(const ModInt& m1, const ModInt& m2) { return make(static_cast<uint>(static_cast<ll>(m1.v) * static_cast<ll>(m2.v) % static_cast<ll>(mod))); }
    friend ModInt operator/(const ModInt& m1, const ModInt& m2) { return m1 * inv(m2.v); }
    friend ModInt operator+(const ModInt& m, const ll val) { return ModInt{static_cast<ll>(m.v) + val}; }
    friend ModInt operator-(const ModInt& m, const ll val) { return ModInt{static_cast<ll>(m.v) - val}; }
    friend ModInt operator*(const ModInt& m, const ll val) { return ModInt{static_cast<ll>(m.v) * (val % static_cast<ll>(mod))}; }
    friend ModInt operator/(const ModInt& m, const ll val) { return ModInt{static_cast<ll>(m.v) * inv(val)}; }
    friend ModInt operator+(const ll val, const ModInt& m) { return ModInt{static_cast<ll>(m.v) + val}; }
    friend ModInt operator-(const ll val, const ModInt& m) { return ModInt{-static_cast<ll>(m.v) + val}; }
    friend ModInt operator*(const ll val, const ModInt& m) { return ModInt{static_cast<ll>(m.v) * (val % static_cast<ll>(mod))}; }
    friend ModInt operator/(const ll val, const ModInt& m) { return ModInt{val * inv(static_cast<ll>(m.v))}; }
    friend ModInt& operator+=(ModInt& m1, const ModInt& m2) { return m1 = m1 + m2; }
    friend ModInt& operator-=(ModInt& m1, const ModInt& m2) { return m1 = m1 - m2; }
    friend ModInt& operator*=(ModInt& m1, const ModInt& m2) { return m1 = m1 * m2; }
    friend ModInt& operator/=(ModInt& m1, const ModInt& m2) { return m1 = m1 / m2; }
    friend ModInt& operator+=(ModInt& m, const ll val) { return m = m + val; }
    friend ModInt& operator-=(ModInt& m, const ll val) { return m = m - val; }
    friend ModInt& operator*=(ModInt& m, const ll val) { return m = m * val; }
    friend ModInt& operator/=(ModInt& m, const ll val) { return m = m / val; }
    friend ModInt operator^(const ModInt& m, const ll n) { return power(m.v, n); }
    friend ModInt& operator^=(ModInt& m, const ll n) { return m = m ^ n; }
    friend bool operator==(const ModInt& m1, const ModInt& m2) { return m1.v == m2.v; }
    friend bool operator!=(const ModInt& m1, const ModInt& m2) { return not(m1 == m2); }
    friend bool operator==(const ModInt& m, const ll val) { return m.v == norm(static_cast<uint>(static_cast<ll>(mod) + val % static_cast<ll>(mod))); }
    friend bool operator!=(const ModInt& m, const ll val) { return not(m == val); }
    friend bool operator==(const ll val, const ModInt& m) { return m.v == norm(static_cast<uint>(static_cast<ll>(mod) + val % static_cast<ll>(mod))); }
    friend bool operator!=(const ll val, const ModInt& m) { return not(m == val); }
    friend std::istream& operator>>(std::istream& is, ModInt& m)
    {
        uint v;
        return is >> v, m = v, is;
    }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& m) { return os << m(); }
    static std::vector<ModInt> invVec(const std::size_t N)
    {
        std::vector<ModInt> ans(N + 1, 1);
        for (std::size_t i = 2; i <= N; i++) { ans[i] = -ans[mod % i] * (mod / i); }
        return ans;
    }
    uint operator()() const { return v; }
};
//!===============================!//
//!  888888ba  d888888P d888888P  !//
//!  88    '8b    88       88     !//
//!  88     88    88       88     !//
//!  88     88    88       88     !//
//!  88     88    88       88     !//
//!  dP     dP    dP       dP     !//
//!===============================!//
template <uint mod = 924844033, uint root = 5>
class NTT
{
private:
    static constexpr std::size_t L = 30;

public:
    NTT() = delete;
    static void ntt(std::vector<ModInt<mod>>& a, const std::size_t lg, const bool rev)
    {
        const std::size_t N = a.size();
        assert(1UL << lg == N);
        static std::vector<ModInt<mod>> R[L];
        if (R[lg].empty()) {
            R[lg].reserve(N), R[lg].resize(N, ModInt<mod>(1));
            const ModInt<mod> r = ModInt<mod>(root) ^ ((mod - 1) / N);
            for (std::size_t i = 1; i < N; i++) { R[lg][i] = R[lg][i - 1] * r; }
        }
        std::vector<ModInt<mod>> tmp(N);
        for (std::size_t w = (N >> 1); w > 0; w >>= 1) {
            for (std::size_t y = 0; y < (N >> 1); y += w) {
                const ModInt<mod> r = rev ? R[lg][y == 0 ? 0 : N - y] : R[lg][y];
                for (std::size_t x = 0; x < w; x++) {
                    const auto u = a[y << 1 | x], v = a[y << 1 | x | w]() * r;
                    tmp[y | x] = u + v, tmp[y | x | (N >> 1)] = u - v;
                }
            }
            std::swap(tmp, a);
        }
        if (rev) {
            for (std::size_t i = 0; i < N; i++) { a[i] /= ModInt<mod>(N); }
        }
    }
    static std::vector<ModInt<mod>> convolute(const std::vector<ModInt<mod>>& a, const std::vector<ModInt<mod>>& b)
    {
        const std::size_t need = a.size() + b.size() - 1, lg = clog(need), N = 1UL << lg;
        std::vector<ModInt<mod>> A(N, 0), B(N, 0);
        for (std::size_t i = 0; i < a.size(); i++) { A[i] = a[i](); }
        for (std::size_t i = 0; i < b.size(); i++) { B[i] = b[i](); }
        ntt(A, lg, false), ntt(B, lg, false);
        for (std::size_t i = 0; i < N; i++) { A[i] *= B[i]; }
        ntt(A, lg, true);
        std::vector<ModInt<mod>> ans(need);
        for (std::size_t i = 0; i < need; i++) { ans[i] = int(A[i]()); }
        return ans;
    }
};
/**
 * @file Poly.hpp
 * @brief Fp[x]のクラス
 */
//!===================================!//
//!   888888ba           dP           !//
//!   88    '8b          88           !//
//!  a88aaaa8P' .d8888b. 88 dP    dP  !//
//!   88        88'  '88 88 88    88  !//
//!   88        88.  .88 88 88.  .88  !//
//!   dP        '88888P' dP '8888P88  !//
//!                              .88  !//
//!                          d8888P   !//
//!===================================!//
/**
 * @brief 剰余多項式
 * @tparam mod 剰余
 * @tparam K 畳み込み時の分割数
 */
template <uint mod = 924844033, uint root = 5>
class Poly
{
    using mint = ModInt<mod>;

public:
    Poly() : v(0) {}
    explicit Poly(const mint& r) : v{r} { shrink(); }
    Poly(const std::vector<mint>& v) : v{v} { shrink(); }
    Poly(const std::initializer_list<mint>&& list) : v{list} { shrink(); }
    std::vector<mint> operator()() const { return v; }
    mint& operator[](const std::size_t i) { return v[i]; }
    const mint& operator[](const std::size_t i) const { return v[i]; }
    mint at(const std::size_t i) const { return i < size() ? v[i] : mint(0); }
    friend Poly operator+(const Poly& p) { return p; }
    friend Poly operator-(const Poly& p)
    {
        std::vector<mint> ans = p.v;
        for (auto& e : ans) { e = -e; }
        return Poly(ans);
    }
    friend Poly operator+(const Poly& p, const Poly& q)
    {
        const std::size_t sz = std::max(p.size(), q.size());
        std::vector<mint> ans(sz);
        for (std::size_t i = 0; i < sz; i++) { ans[i] = p.at(i) + q.at(i); }
        return Poly(ans);
    }
    friend Poly operator-(const Poly& p, const Poly& q)
    {
        const std::size_t sz = std::max(p.size(), q.size());
        std::vector<mint> ans(sz);
        for (std::size_t i = 0; i < sz; i++) { ans[i] = p.at(i) - q.at(i); }
        return Poly(ans);
    }
    friend Poly operator*(const Poly& p, const Poly& q) { return p.size() <= 1000 and q.size() <= 1000 ? naiveMul(p, q) : FFTMul(p, q); }
    friend Poly operator*(const Poly& p, const mint& r)
    {
        std::vector<mint> ans = p.v;
        for (auto& e : ans) { e *= r; }
        return Poly(ans);
    }
    friend Poly operator/(const Poly& p, const mint& r)
    {
        std::vector<mint> ans = p.v;
        for (auto& e : ans) { e /= r; }
        return Poly(ans);
    }
    friend Poly operator>>(const Poly& p, const std::size_t s) { return p.divPow(s); }
    friend Poly operator<<(const Poly& p, const std::size_t s) { return p.mulPow(s); }
    friend Poly operator/(const Poly& p, const Poly& q) { return p.div(q); }
    friend Poly operator%(const Poly& p, const Poly& q) { return p.rem(q); }
    friend Poly& operator+=(Poly& p, const Poly& q) { return p = p + q; }
    friend Poly& operator-=(Poly& p, const Poly& q) { return p = p - q; }
    friend Poly& operator*=(Poly& p, const Poly& q) { return p = p * q; }
    friend Poly& operator*=(Poly& p, const mint& r) { return p = p * r; }
    friend Poly& operator/=(Poly& p, const mint& r) { return p = p / r; }
    friend Poly& operator>>=(Poly& p, const std::size_t s) { return p = (p >> s); }
    friend Poly& operator<<=(Poly& p, const std::size_t s) { return p = (p << s); }
    friend Poly& operator/=(Poly& p, const Poly& q) { return p = p / q; }
    friend Poly& operator%=(Poly& p, const Poly& q) { return p = p % q; }
    /**
     *  @brief p(x)*(x^k)
     */
    Poly mulPow(const std::size_t s) const
    {
        const std::size_t N = size();
        if (N == 0) { return Poly(); }
        std::vector<mint> ans(N + s, 0);
        for (std::size_t i = 0; i < N; i++) { ans[i + s] = v[i]; }
        return Poly(ans);
    }
    /**
     *  @brief p(x)/(x^k)
     */
    Poly divPow(const std::size_t s) const
    {
        const std::size_t N = size();
        if (N <= s) { return Poly(); }
        std::vector<mint> ans(N - s);
        for (std::size_t i = 0; i < N - s; i++) { ans[i] = v[i + s]; }
        return Poly(ans);
    }
    /**
     *  @brief p(x)%(x^k)
     */
    Poly remPow(const std::size_t k) const { return size() <= k ? *this : Poly(std::vector<mint>(v.begin(), v.begin() + k)); }
    /**
     * @brief p(x)q_k(x) = 1 (mod x^{2^k})となる、多項式q_k(x)
     * @details 時間計算量:O(NlogN)
     *          p/qとは違うので注意
     */
    Poly inv(const std::size_t k) const
    {
        Poly q{mint(1) / v[0]};
        const auto T = Poly{2};
        for (std::size_t i = 1, j = 0; j < k; j++, i *= 2) { q = (q * (T - remPow(2 * i) * q)).remPow(2 * i); }
        return q;
    }
    /**
     * @brief x^k (mod p(x))
     * @details 時間計算量:O(NlogNlogK)
     */
    static Poly powRem(const long long k, const Poly& p)
    {
        const std::size_t B = p.size() * 2 - 1;
        const auto q = p.pseudoInv(B);
        Poly ans{1};
        const std::size_t D = log2p1<std::size_t>(k);
        for (std::size_t i = 0; i < D; i++) {
            if (k & (1LL << (D - i - 1))) { ans = (ans.mulPow(1)).rem(p, q, B); }
            if (D - i - 1) { ans = (ans * ans).rem(p, q, B); }
        }
        return ans;
    }
    std::size_t size() const { return v.size(); }
    friend std::ostream& operator<<(std::ostream& os, const Poly& p)
    {
        if (p.size() == 0) { return os << "0"; }
        for (std::size_t i = 0; i < p.size(); i++) { os << (i != 0 ? "+" : "") << p[i] << (i != 0 ? i == 1 ? "X" : "X^" + std::to_string(i) : ""); }
        return os;
    }

private:
    static std::vector<mint> naiveConvolute(const std::vector<mint>& a, const std::vector<mint>& b)
    {
        std::vector<mint> ans(a.size() + b.size() - 1, 0);
        for (std::size_t i = 0; i < a.size(); i++) {
            for (std::size_t j = 0; j < b.size(); j++) { ans[i + j] += a[i] * b[j]; }
        }
        return ans;
    }
    static Poly naiveMul(const Poly& p, const Poly& q) { return p.size() == 0 or q.size() == 0 ? Poly{} : Poly{naiveConvolute(p(), q())}; }
    static std::vector<mint> karatsubaConvolute(const std::vector<mint>& a, const std::vector<mint>& b)
    {
        const std::size_t N = a.size();
        if (N <= 32) { return naiveConvolute(a, b); }
        const std::size_t H = N / 2;
        std::vector<mint> al(a.begin(), a.begin() + H), ah(a.begin() + H, a.end());
        std::vector<mint> bl(b.begin(), b.begin() + H), bh(b.begin() + H, b.end());
        auto c1 = karatsubaConvolute(al, bl), c3 = karatsubaConvolute(ah, bh);
        for (std::size_t i = 0; i < H; i++) { ah[i] -= al[i], bh[i] -= bl[i]; }
        auto c2 = karatsubaConvolute(ah, bh);
        const std::size_t M = c1.size();
        for (std::size_t i = 0; i < M; i++) { c2[i] -= (c1[i] + c3[i]); }
        std::vector<mint> ans(a.size() + b.size() - 1, 0);
        for (std::size_t i = 0; i < M; i++) { ans[i] += c1[i], ans[i + H] -= c2[i], ans[i + 2 * H] += c3[i]; }
        return ans;
    }
    static Poly karatsubaMul(const Poly& p, const Poly& q)
    {
        if (p.size() == 0 or q.size() == 0) { return Poly{}; }
        auto a = p(), b = q();
        const std::size_t L = std::max(a.size(), b.size());
        const std::size_t N = ceil2(L);
        while (a.size() < N) { a.push_back(0); }
        while (b.size() < N) { b.push_back(0); }
        return Poly{karatsubaConvolute(a, b)};
    }
    static Poly FFTMul(const Poly& p, const Poly& q) { return p.size() == 0 or q.size() == 0 ? Poly() : Poly{NTT<mod, root>::convolute(p(), q())}; }
    Poly rev(const std::size_t l) const
    {
        std::vector<mint> ans = v;
        ans.resize(l), std::reverse(ans.begin(), ans.end());
        return Poly(ans);
    }
    Poly div(const Poly& q) const
    {
        assert(q.size() > 0);
        if (size() < q.size()) { return Poly(); }
        const std::size_t N = size();
        const auto iq = q.pseudoInv(N);
        return (*this * iq).divPow(N - 1);
    }
    Poly rem(const Poly& q) const { return *this - div(q) * q; }
    Poly rem(const Poly& q, const Poly& iq, const std::size_t B) { return *this - q * ((*this * iq).divPow(B - 1)); }
    void shrink()
    {
        for (; not v.empty() and v.back() == 0; v.pop_back()) {}
    }
    Poly pseudoInv(const std::size_t B) const
    {
        const std::size_t N = size();
        return rev(N).inv(B + 2 > N ? clog(B - N + 2) : 0).rev(B + 1 - N);
    }
    std::vector<mint> v;
};
//!=====================================!//
//!  8888ba.88ba           oo           !//
//!  88  '8b  '8b                       !//
//!  88   88   88 .d8888b. dP 88d888b.  !//
//!  88   88   88 88'  '88 88 88'  '88  !//
//!  88   88   88 88.  .88 88 88    88  !//
//!  dP   dP   dP '88888P8 dP dP    dP  !//
//!=====================================!//
int main()
{
    constexpr uint MOD = 998244353;
    constexpr uint root = 5;
    const int N = read<int>(), K = read<int>();
    Graph G(N);
    for (int i = 0; i < N - 1; i++) {
        const int u = read<int>() - 1, v = read<int>() - 1;
        G.addEdge(u, v, true);
    }
    using P = Poly<MOD, root>;
    std::vector<P> f1(N, {0, 1}), f1_f0(N, {1, 1});
    auto dfs = [&, N, K](auto&& self, const int s, const int prev) -> void {
        P F0{1}, F1{0, 1};
        for (const int to : G[s]) {
            if (to == prev) { continue; }
            self(self, to, s);
            F0 *= f1_f0[to];
            F1 *= (f1_f0[to] + (f1[to] >> 1));
            F0 = F0.remPow(K + 1), F1 = F1.remPow(K + 1);
        }
        f1[s] = F1, f1_f0[s] = F0 + F1;
    };
    dfs(dfs, 0, -1);
    std::cout << f1_f0[0].at(K) << std::endl;
    return 0;
}




Measured memory_bytes: 286988