Problem: Let's assume that p and q are strings of positive length, called the container and the key correspondingly, string q only consists of characters 0 and 1. Let's take a look at a simple algorithm that extracts message s from the given container p:
    
    
      
    i = 0;  
    j = 0;  
    s = <>;  
    while i is less than the length of the string p  
    {  
        if q[j] == 1, then add to the right of string s character p[i];  
        increase variables i, j by one;  
        if the value of the variable j equals the length of the string q, then j = 0;   
    }  
    

In the given pseudocode i, j are integer variables, s is a string, '=' is an assignment operator, '==' is a comparison operation, '[]' is the operation of obtaining the string character with the preset index, '<>' is an empty string. We suppose that in all strings the characters are numbered starting from zero. 

We understand that implementing such algorithm is quite easy, so your task is going to be slightly different. You need to construct the lexicographically minimum key of length k, such that when it is used, the algorithm given above extracts message s from container p (otherwise find out that such key doesn't exist).

Input

The first two lines of the input are non-empty strings p and s (1 ≤ |p| ≤ 106, 1 ≤ |s| ≤ 200), describing the container and the message, correspondingly. The strings can contain any characters with the ASCII codes from 32 to 126, inclusive.

The third line contains a single integer k (1 ≤ k ≤ 2000) — the key's length.

Output

Print the required key (string of length k, consisting only of characters 0 and 1). If the key doesn't exist, print the single character 0.

Examples

Input

abacaba
aba
6


Output

100001


Input

abacaba
aba
3


Output

0

Note

String x = x1x2... xp is lexicographically smaller than string y = y1y2... yq, if either p < q and x1 = y1, x2 = y2, ... , xp = yp, or there exists such integer r (0 ≤ r < min(p, q)) that x1 = y1, x2 = y2, ... , xr = yr and xr + 1 < yr + 1. Symbols are compared according to their ASCII codes.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int MAXL1 = 1000005;
const int MAXL2 = 205;
const int MAXK = 2005;
const int BASE = 173;
const int MOD = 1038574661;
int l1, l2, k;
char s1[MAXL1];
char s2[MAXL2];
int cnt, pt;
int hashpart[MAXK];
int hashres[MAXL2];
bool f[MAXK][MAXL2];
bool c[MAXK][MAXL2];
bool hassol;
bool ans[MAXK];
void init() {
  fgets(s1, MAXL1, stdin);
  fgets(s2, MAXL2, stdin);
  scanf("%d", &k);
  l1 = strlen(s1) - 1;
  l2 = strlen(s2) - 1;
}
void work(int c2) {
  for (int i = 0; i < c2; ++i) {
    hashres[i] = 0;
    for (int j = i; j < l2; j += c2)
      hashres[i] = ((long long)hashres[i] * BASE + s2[j]) % MOD;
  }
  memset(f, 0, sizeof(f));
  f[k][c2] = true;
  for (int i = k - 1; i >= 0; --i) {
    int minj = std::max(0, c2 + i - k);
    int maxj = std::min(c2, i);
    for (int j = minj; j <= maxj; ++j) {
      if (f[i + 1][j]) {
        f[i][j] = true;
        c[i][j] = false;
      } else if (hashpart[i] == hashres[j] && f[i + 1][j + 1]) {
        f[i][j] = true;
        c[i][j] = true;
      }
    }
  }
  if (!f[0][0]) return;
  static bool now[MAXK];
  for (int i = 0, j = 0; i < k; ++i) {
    now[i] = c[i][j];
    j += c[i][j];
  }
  if (!hassol || memcmp(now, ans, k * sizeof(bool)) < 0) {
    hassol = true;
    memcpy(ans, now, k * sizeof(bool));
  }
}
void solve() {
  cnt = l1 / k;
  pt = l1 % k;
  for (int i = 0; i < k; ++i) {
    hashpart[i] = 0;
    for (int j = i; j < l1; j += k)
      hashpart[i] = ((long long)hashpart[i] * BASE + s1[j]) % MOD;
  }
  for (int i = 1; i <= k && i <= l2; ++i) {
    int rem = l2 - i * cnt;
    if (rem >= 0 && rem <= i && rem <= pt && i - rem <= k - pt) work(i);
  }
  if (!hassol)
    printf("0\n");
  else {
    for (int i = 0; i < k; ++i) printf("%d", ans[i]);
    printf("\n");
  }
}
int main() {
  init();
  solve();
  return 0;
}