#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x;i<=y;i++)
using namespace std;
#define int long long
const int N = 2e5+10;
const int mod = 998244353;
int qmi(int a,int b) {
    int res = 1;
    for (; b; b >>= 1, a = a * a % mod) {
        if (b & 1)res = res * a % mod;
    }
    return res;
}
void dfs(int u,int fa,int &ans,vector<int>&cnt,deque<int>&q,vector<vector<int>>&e,int k){
    vector<int> tmp;
    while (q.size() and q.front() * 2 <= u)cnt[q.front() * 2 % k]--, tmp.push_back(q.front()), q.pop_front();

    int x = cnt[u % k] + 1;
    if (u % k == 0 and u != 0)x++;
    ans = ans * x % mod;

    cnt[u * 2 % k]++, q.push_back(u);

    for (auto &v: e[u]) {
        dfs(v, u,ans,cnt,q,e,k);
    }

    while (tmp.size())cnt[tmp.back() * 2 % k]++, q.push_front(tmp.back()), tmp.pop_back();
    cnt[u * 2 % k]--;
    q.pop_back();
}
void solve(int tc) {
    string s;
    int k;
    cin >> s >> k;
    s = " " + s;
    int n = s.size();
    vector<int> nxt(n);
    vector<vector<int>> e(n);
    e[0].push_back(1);
    for (int i = 2,j=0; i < n; i++) {
        while (j and s[j + 1] != s[i])j = nxt[j];
        if (s[j + 1] == s[i])j++;
        nxt[i] = j;
        e[j].push_back(i);
    }
    vector<int> cnt(k);
    int ans = 1;
    deque<int> q;
    dfs(0, -1,ans,cnt,q,e,k);
    cout << ans;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tc = 1;
    cin >> tc;
    for (int i = 1; i <= tc; i++) {
        solve(i);
    }
}