#include <bits/stdc++.h>
using namespace std;

int K;
long long M;
vector<string> nums;   // cac so N duoc giu duoi dang chuoi (co the rat dai, toi 100 chu so)

// Sub 1: vet can - voi moi so, lap viec cong cac chu so (tren chuoi) cho den khi con mot chu so.
// Cach nay dung cho moi so vi khong bao gio can so lon.
void sub1() {
    for (int i = 0; i < K; i++) {
        string s = nums[i];
        while (s.size() > 1) {
            int t = 0;
            for (char c : s) t += c - '0';
            s = to_string(t);   // tong cac chu so moi
        }
        cout << (s[0] - '0' == M ? 1 : 0) << "\n";
    }
}

// Sub 2: dung tinh chat chia 9 - voi N > 0 thi chu so cuoi cung la (N mod 9), neu chia het cho 9 thi la 9.
// Tinh N mod 9 bang cach cong cac chu so mod 9 nen chay O(do dai) cho moi so, khong can lap.
void sub2() {
    for (int i = 0; i < K; i++) {
        int r = 0;
        for (char c : nums[i]) r = (r + (c - '0')) % 9;
        int root = (r == 0) ? 9 : r;
        cout << (root == M ? 1 : 0) << "\n";
    }
}

int main() {
    freopen("CAU3.INP", "r", stdin);     // may cham doc/ghi file
    freopen("CAU3.OUT", "w", stdout);
    cin >> K >> M;
    nums.resize(K);
    for (int i = 0; i < K; i++) cin >> nums[i];
    // Moi so co toi 100 chu so nen sub2 (chia 9) la cach nhanh nhat; du lieu nho van dung sub1
    if (K <= 100) sub1();
    else sub2();
    return 0;
}