#pragma GCC optimize(3, "unroll-loops", "no-stack-protector")
#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) {
    x = min(x, y);
}
template <typename T>
inline void chkmax(T &x, T y) {
    x = max(x, y);
}
namespace FastIO {
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if (defined(LOCAL) || defined(_WIN32)) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include <sys/mman.h>
#endif
#ifdef LOCAL
inline char gc() { return getchar(); }
inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
INLINE_V constexpr int _READ_SIZE = 1 << 18;
INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr,
                                               *_read_ptr_end = nullptr;
inline char gc() {
    if (__builtin_expect(_read_ptr == _read_ptr_end, false)) {
        _read_ptr = _read_buffer;
        _read_ptr_end =
            _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
        if (__builtin_expect(_read_ptr == _read_ptr_end, false)) return EOF;
#endif
    }
    return *_read_ptr++;
}
#else
INLINE_V static const char *_read_ptr =
    (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
inline char gc() { return *_read_ptr++; }
#endif
INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
inline void pc(char c) {
    *_write_ptr++ = c;
    if (__builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false)) {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
        _write_ptr = _write_buffer;
    }
}
INLINE_V struct _auto_flush {
    ~_auto_flush() {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
    }
} _auto_flush;
#endif
#ifdef CHK_EOF
inline bool _isdigit(char c) { return (c & 16) && c != EOF; }
inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
inline bool _isdigit(char c) { return c & 16; }
inline bool _isgraph(char c) { return c > 32; }
#endif
template <class T>
INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <class T>
INLINE_V constexpr bool _is_signed = numeric_limits<T>::is_signed;
template <class T>
INLINE_V constexpr bool _is_unsigned = _is_integer<T> && !_is_signed<T>;
template <>
INLINE_V constexpr bool _is_integer<__int128> = true;
template <>
INLINE_V constexpr bool _is_integer<__uint128_t> = true;
template <>
INLINE_V constexpr bool _is_signed<__int128> = true;
template <>
INLINE_V constexpr bool _is_unsigned<__uint128_t> = true;
#undef INLINE_V
inline void read(char &c) {
    do c = gc();
    while (!_isgraph(c));
}
inline void read_cstr(char *s) {
    char c = gc();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) *s++ = c, c = gc();
    *s = 0;
}
inline void read(string &s) {
    char c = gc();
    s.clear();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) s.push_back(c), c = gc();
}
#ifdef IN_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void read(T &x) {
    char c = gc();
    bool f = true;
    x = 0;
    while (!_isdigit(c)) {
        if (c == 45) f = false;
        c = gc();
    }
    if (f)
        while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
    else
        while (_isdigit(c)) x = x * 10 - (c & 15), c = gc();
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void read(T &x) {
    char c = gc();
    while (!_isdigit(c)) c = gc();
    x = 0;
    while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
}
inline void write(char c) { pc(c); }
inline void write_cstr(const char *s) {
    while (*s) pc(*s++);
}
inline void write(const string &s) {
    for (char c : s) pc(c);
}
#ifdef OUT_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    if (x >= 0) do
            buffer[digits++] = (x % 10) | 48, x /= 10;
        while (x);
    else {
        pc(45);
        do buffer[digits++] = -(x % 10) | 48, x /= 10;
        while (x);
    }
    while (digits) pc(buffer[--digits]);
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    do buffer[digits++] = (x % 10) | 48, x /= 10;
    while (x);
    while (digits) pc(buffer[--digits]);
}
template <int N>
struct _tuple_io_helper {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_read(x), read(get<N - 1>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_write(x), pc(32), write(get<N - 1>(x));
    }
};
template <>
struct _tuple_io_helper<1> {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        read(get<0>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        write(get<0>(x));
    }
};
template <class... T>
inline void read(tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_read(x);
}
template <class... T>
inline void write(const tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_write(x);
}
template <class T1, class T2>
inline void read(pair<T1, T2> &x) {
    read(x.first), read(x.second);
}
template <class T1, class T2>
inline void write(const pair<T1, T2> &x) {
    write(x.first), pc(32), write(x.second);
}
template <class T1, class... T2>
inline void read(T1 &x, T2 &...y) {
    read(x), read(y...);
}
template <class... T>
inline void read_cstr(char *x, T *...y) {
    read_cstr(x), read_cstr(y...);
}
template <class T1, class... T2>
inline void write(const T1 &x, const T2 &...y) {
    write(x), write(y...);
}
template <class... T>
inline void write_cstr(const char *x, const T *...y) {
    write_cstr(x), write_cstr(y...);
}
template <class T>
inline void print(const T &x) {
    write(x);
}
inline void print_cstr(const char *x) { write_cstr(x); }
template <class T1, class... T2>
inline void print(const T1 &x, const T2 &...y) {
    print(x), pc(32), print(y...);
}
template <class... T>
inline void print_cstr(const char *x, const T *...y) {
    print_cstr(x), pc(32), print_cstr(y...);
}
inline void println() { pc(10); }
inline void println_cstr() { pc(10); }
template <class... T>
inline void println(const T &...x) {
    print(x...), pc(10);
}
template <class... T>
inline void println_cstr(const T *...x) {
    print_cstr(x...), pc(10);
}
}  // namespace FastIO
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}
const int N = 2e5 + 10;
// void build(int u, int L, int R) {
    // if (L == R) return;
// }
// void update(int u, int L, int R, int l, int r) {
// 
// }

template <uint32_t mod = 998244353>
class Modint {
   private:
    static constexpr uint32_t get_r() {
        uint32_t ret = mod;
        for (int i = 0; i < 4; i++) ret *= 2 - mod * ret;
        return ret;
    }
    static constexpr uint32_t r = get_r();
    static constexpr uint32_t n2 = -uint64_t(mod) % mod;
    static_assert(r * mod == 1 && mod < (1 << 30) && mod & 1);
    uint32_t data;

   public:
    constexpr Modint() : data(0) {}
    template <class int_t>
    constexpr Modint(const int_t x)
        : data(reduce(
              uint64_t((sizeof(int_t) < sizeof(uint32_t) ? x : x % int_t(mod)) +
                       mod) *
              n2)){};
    static constexpr uint32_t reduce(const uint64_t x) {
        return (x + uint64_t(uint32_t(x) * (-r)) * mod) >> 32;
    }
    constexpr Modint &operator+=(const Modint &r) {
        if (int32_t(data += r.data - 2 * mod) < 0) {
            data += 2 * mod;
        }
        return *this;
    }
    constexpr Modint &operator-=(const Modint &r) {
        if (int32_t(data -= r.data) < 0) {
            data += 2 * mod;
        }
        return *this;
    }
    constexpr Modint &operator*=(const Modint &r) {
        return data = reduce((uint64_t)data * r.data), *this;
    }
    constexpr Modint &operator/=(const Modint &r) { return *this *= r.inv(); }
    constexpr friend Modint operator+(Modint l, const Modint &r) {
        return l += r;
    }
    constexpr friend Modint operator-(Modint l, const Modint &r) {
        return l -= r;
    }
    constexpr friend Modint operator*(Modint l, const Modint &r) {
        return l *= r;
    }
    constexpr friend Modint operator/(Modint l, const Modint &r) {
        return l /= r;
    }
    constexpr friend bool operator==(Modint l, const Modint &r) {
        return l.value() == r.value();
    }
    constexpr Modint operator-() const { return Modint() - Modint(*this); }
    template <class int_t>
    constexpr Modint pow(int_t r) const {
        Modint res(1), w(*this);
        for (; r; r >>= 1, w *= w)
            if (r & 1) res *= w;
        return res;
    }
    constexpr Modint inv() const { return pow(mod - 2); }
    constexpr uint32_t value() const {
        uint32_t res = reduce(data);
        return res >= mod ? res - mod : res;
    }
};
using modint = Modint<>;
modint pw[N], ipw[N];
vector<tuple<int, int, int> > vec[N];
int n, q;
modint ans[N];
char str[N];
bool f[20][N][2], g[20][N][2];
int lcp[N][2], lcs[N][2], s[N];

struct Matrix {
    modint mat[3][3];
    inline Matrix operator*(Matrix b) {
        Matrix ans;
        for (int k = 0; k < 3; k++) 
            for (int i = 0; i < 3; i++)
                for (int j = 0; j < 3; j++) ans.mat[i][j] += mat[i][k] * b.mat[k][j];
        return ans;
    }
} tag[N << 2], I;
struct Hang{
    modint mat[3];
    inline Hang operator*(Matrix b) {
        Hang ans;
        for (int k = 0; k < 3; k++)
            for (int i = 0; i < 3; i++) ans.mat[i] += mat[k] * b.mat[k][i];
        return ans;
    }
    inline Hang operator+(Hang b) {
        return {mat[0] + b.mat[0], mat[1] + b.mat[1], mat[2] + b.mat[2]};
    }
} w[N << 2];
bool vis[N];
modint pa[N], pb[N];
inline void maketag(int u, Matrix v) {
    vis[u] = 1, tag[u] = tag[u] * v, w[u] = w[u] * v;
}
inline void pushdown(int u) {
    if (vis[u]) vis[u] = 0, maketag(u << 1, tag[u]), maketag(u << 1 | 1, tag[u]), tag[u] = I;
}
void build(int u, int L, int R) {
    tag[u] = I;
    if (L == R) {
        w[u].mat[0] = pw[s[R - 1]];
        return;
    }
    int M = L + R >> 1;
    build(u << 1, L, M), build(u << 1 | 1, M + 1, R);
    w[u] = w[u << 1] + w[u << 1 | 1];
}
vector<pair<int, int> > que[N];
void update(int u, int L, int R, int l, int r, Matrix v) {
    if (L >= l && R <= r) return maketag(u, v);
    if (L > r || R < l) return;
    int M = L + R >> 1;
    pushdown(u);
    update(u << 1, L, M, l, r, v), update(u << 1 | 1, M + 1, R, l, r, v);
    w[u] = w[u << 1] + w[u << 1 | 1];
}
inline modint query(int u, int L, int R, int l, int r) {
    if (L >= l && R <= r) return w[u].mat[2];
    if (L > r || R < l) return 0;
    int M = L + R >> 1;
    pushdown(u);
    return query(u << 1, L, M, l, r) + query(u << 1 | 1, M + 1, R, l, r);
} 
int main() {
    for (int i = 0; i < 3; i++) I.mat[i][i] = 1;
    read(n, q);
    for (int i = 0; i <= n; i++) pw[i] = modint(2).pow(i), ipw[i] = pw[i].inv();
    read_cstr(str + 1);
    for (int i = 1; i <= q; i++) {
        int l, r;
        read(l, r), ++l, ++r, que[r].emplace_back(l, i);
    }
    for (int i = 1; i <= n; i++) s[i] = s[i - 1] + (str[i] == '?');
    for (int i = n; i; i--) {
        if (str[i] != '1') f[0][i][0] = 1;
        if (str[i] != '0') f[0][i][1] = 1;
        for (int j = 1; j < 20; j++)
            if ((i + (1 << j)) - 1 <= n) {
                f[j][i][0] |= f[j - 1][i][0] && f[j - 1][i + (1 << j - 1)][1];
                f[j][i][1] |= f[j - 1][i][1] && f[j - 1][i + (1 << j - 1)][0];
            }
        for (int p = 0; p <= 1; p++) {
            int pos = -1;
            for (int j = 19; ~j; j--)
                if (f[j][i][p]) { pos = j; break; }
            if (pos == -1) continue;
            bool fl = p ^ 1;
            lcp[i][p] = 1 << pos;
            // if (i == 1 && p == 1) cerr << "find youmo:" << i << ' ' << pos << endl;
            while (pos) {
                pos--;
                // if (i == 1 && p == 1) cerr << "find qiqi:" << f[pos][i + lcp[i][p]][fl] << ' ' << fl << endl;
                if (f[pos][i + lcp[i][p]][fl]) fl ^= 1, lcp[i][p] += 1 << pos;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        if (str[i] != '1') g[0][i][0] = 1;
        if (str[i] != '0') g[0][i][1] = 1;
        for (int j = 1; j < 20; j++)
            if ((i - (1 << j)) + 1 <= n) {
                g[j][i][0] |= g[j - 1][i][0] && g[j - 1][i - (1 << j - 1)][1];
                g[j][i][1] |= g[j - 1][i][1] && g[j - 1][i - (1 << j - 1)][0];
            }
        for (int p = 0; p <= 1; p++) {
            int pos = -1;
            for (int j = 19; ~j; j--)
                if (g[j][i][p]) { pos = j; break; }
            if (pos == -1) continue;
            bool fl = p ^ 1;
            lcs[i][p] = 1 << pos;
            while (pos) {
                pos--;
                if (g[pos][i - lcs[i][p]][fl]) fl ^= 1, lcs[i][p] += 1 << pos;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        vec[i].emplace_back(i, i, 1), vec[i + 1].emplace_back(i, i, -1);
        if (str[i] == '?')
        vec[i].emplace_back(i, i, 1), vec[i + 1].emplace_back(i, i, -1);

    }
    // cerr << "find zqs:" << f[2][1][0] << endl;
    // for (int i = 1; i <= n; i++) cerr << lcp[i][0] << ' '; cerr << endl;
    // for (int i = 1; i <= n; i++) cerr << lcp[i][1] << ' '; cerr << endl;
    // for (int i = 1; i <= n; i++) cerr << lcs[i][0] << ' '; cerr << endl;
    // for (int i = 1; i <= n; i++) cerr << lcs[i][1] << ' '; cerr << endl;
    // cerr << lcp[1] << ' ' << lcs[1] << endl;
    for (int i = 2; i <= n; i++) {
        for (int p = 0; p < 2; p++)
            for (int q = 0; q < 2; q++) if (lcs[i - 1][p] && lcp[i][q]) {
                int l = i - lcs[i - 1][p], r = i + lcp[i][q] - 1;
                // cerr << "find zhangjunyoutl:" << l << ' ' << i << ' ' << r << endl;
                vec[i].emplace_back(l, i - 1, 1);
                vec[r + 1].emplace_back(l, i - 1, - 1);
            }
    }
    for (int k = 0; (1 << k) <= n; k++) {
        for (int i = 1; i <= (n - (1 << k) + 1); i++)
            for (int p = 0; p < 2; p++) if (f[k][i][p]) {
                int lenl = lcs[i - 1][(p ^ k) & 1], lenr = lcp[i + (1 << k)][p ^ 1];
                if (!lenr || !lenl) continue;
                // cerr << "find del:" << i << ' ' << lenl << ' ' << lenr << endl;
                chkmin(lenl, (1 << k)), chkmin(lenr, (1 << k));
                vec[i + (1 << k)].emplace_back(i - lenl, i - 1, -1);
                vec[i + (1 << k) + lenr].emplace_back(i - lenl, i - 1, 1);
            }
    }
    build(1, 1, n);
    for (int i = 1; i <= n; i++) {
        for (auto [l, r, v] : vec[i]) {
            // cerr << "find zhangjunyoudatanglong:" << i << ' ' << l << ' ' << r << ' ' << v << endl;
            update(1, 1, n, l, r, {1, modint(v), 0, 0, 1, 0, 0, 0, 1});
            // for (int j = l; j <= r; j++) pa[j] += v;
        }
        // cerr << "find youmo:" << w[1].mat[0].value() << ' ' << w[1].mat[1].value() << endl;
        maketag(1, {1, 0, 0, 0, 1, modint(ipw[s[i]]), 0, 0, 1});
        // for (int j = 1; j <= n; j++) pb[j] += pa[j] * pw[s[j - 1]] * ipw[s[i]];
        // cerr << "find youmo:" << w[1].mat[2].value() << endl;
        for (auto [l, id] : que[i]) {
            modint res = 0;
            // cerr << "find youmo:" << l << ' ' << id << endl;
             ans[id] = query(1, 1, n, l, i) * pw[s[i] - s[l - 1]];
            // for (int j = l; j <= i; j++) res += pb[j];
            // ans[id] = res * pw[s[i] - s[l - 1]];
        }
    }
    for (int i = 1; i <= q; i++) println(ans[i].value());
    return 0;
}
// A + B + C

/*

1 1
?
0 0

4 4
??00
0 0
0 1
0 2
0 3
*/
// B common / flip