#include <bits/stdc++.h>

#include <atcoder/modint>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)

using i64 = std::int64_t;

using mint = atcoder::modint998244353;

int main() {
    int n;
    int x;
    std::cin >> n >> x;
    mint ans = 0;
    rep(i,11,x+1) {
        if(i % 11 != 0) continue;
        std::vector<int> p;
        {
            int ret = i;
            while(ret > 0) {
                p.emplace_back(ret % 10);
                ret /= 10;
            }
            std::reverse(p.begin(), p.end());
        }
        int sz = p.size();
        bool is_ok = true;
        rep(j,0,sz) {
            int now = 0;
            rep(k,0,sz) {
                if(k == j) continue;
                now = now * 10 + p[k];
                now %= 11;
            }
            is_ok &= now != 0;
        }
        if(is_ok) ans++;
    }
    std::cout << ans.val() << '\n';
}