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>
using namespace std;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const long long BASE[2] = {97, 67};
const int N = 2e3 + 10, M = 2e2 + 10;
string s1, s2, ans;
int n, m, k, t[N][M];
pair<int, int> g[N][2];
void prepare() {
  getline(cin, s1);
  getline(cin, s2);
  cin >> k;
  n = s1.length(), m = s2.length();
}
pair<int, int> calhash(int cur, int len, int type) {
  int ans = 0, c = 0;
  for (int j = cur; j < m; j += len)
    ans = (BASE[type] * ans + s2[j] - 32) % MOD, c++;
  return pair<int, int>(ans, c);
}
bool operator==(pair<int, int> a, pair<int, int> b) {
  return (a.first == b.first && a.second == b.second);
}
string solve() {
  int k1 = min(k, n);
  for (auto i = 1; i <= k1; i++) ans.push_back('2');
  for (auto i = 0; i < k1; i++)
    for (int j = i; j < n; j += k1)
      for (auto j1 = 0; j1 <= 1; j1++) {
        g[i][j1].first = (BASE[j1] * g[i][j1].first + s1[j] - 32) % MOD;
        g[i][j1].second++;
      }
  for (auto use = 1; use <= m; use++) {
    memset(t[k1], 0, sizeof(t[k1]));
    t[k1][use] = -1;
    for (auto i = k1; i >= 1; i--) {
      for (auto j = 0; j <= use; j++) t[i - 1][j] = (t[i][j] ? 1 : 0);
      for (auto j = 0; j < use; j++)
        if (!t[i - 1][j] && t[i][j + 1]) {
          pair<int, int> x[2] = {calhash(j, use, 0), calhash(j, use, 1)};
          if (x[0] == g[i - 1][0] && x[1] == g[i - 1][1]) t[i - 1][j] = 2;
        }
    }
    if (t[0][0]) {
      int cur = 0;
      bool sma = 0;
      for (auto i = 0; i < k1; i++) {
        int x = t[i][cur] - 1;
        if (!sma && x > ans[i] - '0') break;
        sma |= (x < ans[i] - '0');
        ans[i] = '0' + x;
        cur += x;
      }
    }
  }
  if (ans[0] == '2') return "0";
  for (auto i = k1 + 1; i <= k; i++) ans.push_back('0');
  return ans;
}
int main() {
  prepare();
  cout << solve();
}