#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << '{';
  string sep;
  for (const auto &x : v) os << sep << x, sep = ", ";
  return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
  cerr << ' ' << H;
  dbg_out(T...);
}
template <const int &MOD>
struct _m_int {
  int val;
  _m_int(int64_t v = 0) {
    if (v < 0) v = v % MOD + MOD;
    if (v >= MOD) v %= MOD;
    val = v;
  }
  static int mod_inv(int a, int m = MOD) {
    int g = m, r = a, x = 0, y = 1;
    while (r != 0) {
      int q = g / r;
      g %= r;
      swap(g, r);
      x -= q * y;
      swap(x, y);
    }
    return x < 0 ? x + m : x;
  }
  explicit operator int() const { return val; }
  explicit operator int64_t() const { return val; }
  _m_int &operator+=(const _m_int &other) {
    val -= MOD - other.val;
    if (val < 0) val += MOD;
    return *this;
  }
  _m_int &operator-=(const _m_int &other) {
    val -= other.val;
    if (val < 0) val += MOD;
    return *this;
  }
  static unsigned fast_mod(uint64_t x, unsigned m = MOD) {
    return x % m;
    unsigned x_high = x >> 32, x_low = (unsigned)x;
    unsigned quot, rem;
    asm("divl %4\n" : "=a"(quot), "=d"(rem) : "d"(x_high), "a"(x_low), "r"(m));
    return rem;
  }
  _m_int &operator*=(const _m_int &other) {
    val = fast_mod((uint64_t)val * other.val);
    return *this;
  }
  _m_int &operator/=(const _m_int &other) { return *this *= other.inv(); }
  friend _m_int operator+(const _m_int &a, const _m_int &b) {
    return _m_int(a) += b;
  }
  friend _m_int operator-(const _m_int &a, const _m_int &b) {
    return _m_int(a) -= b;
  }
  friend _m_int operator*(const _m_int &a, const _m_int &b) {
    return _m_int(a) *= b;
  }
  friend _m_int operator/(const _m_int &a, const _m_int &b) {
    return _m_int(a) /= b;
  }
  _m_int &operator++() {
    val = val == MOD - 1 ? 0 : val + 1;
    return *this;
  }
  _m_int &operator--() {
    val = val == 0 ? MOD - 1 : val - 1;
    return *this;
  }
  _m_int operator++(int) {
    _m_int before = *this;
    ++*this;
    return before;
  }
  _m_int operator--(int) {
    _m_int before = *this;
    --*this;
    return before;
  }
  _m_int operator-() const { return val == 0 ? 0 : MOD - val; }
  bool operator==(const _m_int &other) const { return val == other.val; }
  bool operator!=(const _m_int &other) const { return val != other.val; }
  _m_int inv() const { return mod_inv(val); }
  _m_int pow(int64_t p) const {
    if (p < 0) return inv().pow(-p);
    _m_int a = *this, result = 1;
    while (p > 0) {
      if (p & 1) result *= a;
      a *= a;
      p >>= 1;
    }
    return result;
  }
  friend ostream &operator<<(ostream &os, const _m_int &m) {
    return os << m.val;
  }
};
extern const int MOD = 2130706433;
using mod_int = _m_int<MOD>;
template <const int &MOD>
struct NTT {
  using ntt_int = _m_int<MOD>;
  vector<ntt_int> roots = {0, 1};
  vector<int> bit_reverse;
  int max_size = -1;
  ntt_int root;
  void reset() {
    roots = {0, 1};
    max_size = -1;
  }
  static bool is_power_of_two(int n) { return (n & (n - 1)) == 0; }
  static int round_up_power_two(int n) {
    while (n & (n - 1)) n = (n | (n - 1)) + 1;
    return max(n, 1);
  }
  static int get_length(int n) {
    assert(is_power_of_two(n));
    return __builtin_ctz(n);
  }
  void bit_reorder(int n, vector<ntt_int> &values) {
    if ((int)bit_reverse.size() != n) {
      bit_reverse.assign(n, 0);
      int length = get_length(n);
      for (int i = 1; i < n; i++)
        bit_reverse[i] = (bit_reverse[i >> 1] >> 1) | ((i & 1) << (length - 1));
    }
    for (int i = 0; i < n; i++)
      if (i < bit_reverse[i]) swap(values[i], values[bit_reverse[i]]);
  }
  void find_root() {
    max_size = 1 << __builtin_ctz(MOD - 1);
    root = 2;
    while (!(root.pow(max_size) == 1 && root.pow(max_size / 2) != 1)) root++;
  }
  void prepare_roots(int n) {
    if (max_size < 0) find_root();
    assert(n <= max_size);
    if ((int)roots.size() >= n) return;
    int length = get_length(roots.size());
    roots.resize(n);
    while (1 << length < n) {
      ntt_int z = root.pow(max_size >> (length + 1));
      for (int i = 1 << (length - 1); i < 1 << length; i++) {
        roots[2 * i] = roots[i];
        roots[2 * i + 1] = roots[i] * z;
      }
      length++;
    }
  }
  void fft_iterative(int N, vector<ntt_int> &values) {
    assert(is_power_of_two(N));
    prepare_roots(N);
    bit_reorder(N, values);
    for (int n = 1; n < N; n *= 2)
      for (int start = 0; start < N; start += 2 * n)
        for (int i = 0; i < n; i++) {
          ntt_int even = values[start + i];
          ntt_int odd = values[start + n + i] * roots[n + i];
          values[start + n + i] = even - odd;
          values[start + i] = even + odd;
        }
  }
  void invert_fft(int N, vector<ntt_int> &values) {
    ntt_int inv_N = ntt_int(N).inv();
    for (int i = 0; i < N; i++) values[i] *= inv_N;
    reverse(values.begin() + 1, values.end());
    fft_iterative(N, values);
  }
  const int FFT_CUTOFF = 300;
  template <typename T>
  vector<T> mod_multiply(const vector<T> &_left, const vector<T> &_right,
                         bool circular = false) {
    if (_left.empty() || _right.empty()) return {};
    vector<ntt_int> left(_left.begin(), _left.end());
    vector<ntt_int> right(_right.begin(), _right.end());
    int n = left.size();
    int m = right.size();
    int output_size = circular ? round_up_power_two(max(n, m)) : n + m - 1;
    if (min(n, m) < FFT_CUTOFF) {
      auto &&mod_output_size = [&](int x) {
        return x < output_size ? x : x - output_size;
      };
      static const uint64_t U64_BOUND =
          numeric_limits<uint64_t>::max() - (uint64_t)MOD * MOD;
      vector<uint64_t> result(output_size, 0);
      for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) {
          int index = mod_output_size(i + j);
          result[index] += (uint64_t)(int64_t)left[i] * (int64_t)right[j];
          if (result[index] > U64_BOUND) result[index] %= MOD;
        }
      for (uint64_t &x : result)
        if (x >= MOD) x %= MOD;
      return vector<T>(result.begin(), result.end());
    }
    int N = round_up_power_two(output_size);
    left.resize(N, 0);
    right.resize(N, 0);
    if (left == right) {
      fft_iterative(N, left);
      right = left;
    } else {
      fft_iterative(N, left);
      fft_iterative(N, right);
    }
    for (int i = 0; i < N; i++) left[i] *= right[i];
    invert_fft(N, left);
    return vector<T>(left.begin(), left.begin() + output_size);
  }
  template <typename T>
  vector<T> mod_power(const vector<T> &v, int exponent) {
    assert(exponent >= 0);
    vector<T> result = {1};
    if (exponent == 0) return result;
    for (int k = 31 - __builtin_clz(exponent); k >= 0; k--) {
      result = mod_multiply(result, result);
      if (exponent >> k & 1) result = mod_multiply(result, v);
    }
    return result;
  }
  template <typename T>
  vector<T> mod_multiply_all(const vector<vector<T>> &polynomials) {
    if (polynomials.empty()) return {1};
    struct compare_size {
      bool operator()(const vector<T> &x, const vector<T> &y) {
        return x.size() > y.size();
      }
    };
    priority_queue<vector<T>, vector<vector<T>>, compare_size> pq(
        polynomials.begin(), polynomials.end());
    while (pq.size() > 1) {
      vector<T> a = pq.top();
      pq.pop();
      vector<T> b = pq.top();
      pq.pop();
      pq.push(mod_multiply(a, b));
    }
    return pq.top();
  }
};
NTT<MOD> ntt;
auto random_address = [] {
  char *p = new char;
  delete p;
  return (uint64_t)p;
};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count() *
               (random_address() | 1));
const int ALPHABET = 26;
const char MIN_CHAR = 'a';
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  vector<int> P(ALPHABET);
  for (int &p : P) {
    cin >> p;
    p--;
  }
  string S, T;
  cin >> S >> T;
  int N = S.size(), M = T.size();
  vector<int8_t> A(N), B(N), X(M);
  for (int i = 0; i < N; i++) {
    A[i] = S[i] - MIN_CHAR;
    B[i] = P[A[i]];
  }
  for (int i = 0; i < M; i++) X[i] = T[i] - MIN_CHAR;
  ;
  vector<mod_int> values(ALPHABET);
  for (int c = 0; c < ALPHABET; c++) values[c] = rng();
  vector<mod_int> scores(M - N + 1, 0);
  mod_int sum = 0;
  for (int i = 0; i < M; i++) {
    sum += values[X[i]].pow(2);
    if (i >= N - 1) {
      scores[i - (N - 1)] += sum;
      sum -= values[X[i - (N - 1)]].pow(2);
    }
  }
  vector<mod_int> left(N), right(M);
  for (int i = 0; i < N; i++) left[i] = values[A[i]] + values[B[i]];
  for (int i = 0; i < M; i++) right[i] = values[X[i]];
  reverse(left.begin(), left.end());
  auto product = ntt.mod_multiply(left, right, true);
  for (int i = 0; i <= M - N; i++) scores[i] -= product[i + N - 1];
  sum = 0;
  for (int i = 0; i < N; i++) sum += values[A[i]] * values[B[i]];
  for (auto &score : scores) score += sum;
  ;
  for (auto &score : scores) cout << (score == 0 ? '1' : '0');
  cout << '\n';
}
