text: //Optimise
  #include <bits/stdc++.h>
  #include <ext/pb_ds/assoc_container.hpp>
  #include <ext/pb_ds/tree_policy.hpp>
  using namespace std;
  using namespace __gnu_pbds;
  
  // #define MULTI_TEST
  #ifdef LOCAL
  #define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
  #define pc(...) PC(#__VA_ARGS__, __VA_ARGS__);
  template <typename T, typename U>
  ostream &operator<<(ostream &out, const pair<T, U> &p)
  {
      out << '[' << p.first << ", " << p.second << ']';
      return out;
  }
  template <typename Arg>
  void PC(const char *name, Arg &&arg)
  {
      while (*name == ',' || *name == ' ')
          name++;
      std::cerr << name << " { ";
      for (const auto &v : arg)
          cerr << v << ' ';
      cerr << " }\n";
  }
  template <typename Arg1, typename... Args>
  void PC(const char *names, Arg1 &&arg1, Args &&... args)
  {
      while (*names == ',' || *names == ' ')
          names++;
      const char *comma = strchr(names, ',');
      std::cerr.write(names, comma - names) << " { ";
      for (const auto &v : arg1)
          cerr << v << ' ';
      cerr << " }\n";
      PC(comma, args...);
  }
  template <typename Arg1>
  void ZZ(const char *name, Arg1 &&arg1)
  {
      std::cerr << name << " = " << arg1 << endl;
  }
  template <typename Arg1, typename... Args>
  void ZZ(const char *names, Arg1 &&arg1, Args &&... args)
  {
      const char *comma = strchr(names + 1, ',');
      std::cerr.write(names, comma - names) << " = " << arg1;
      ZZ(comma, args...);
  }
  #else
  #define db(...)
  #define pc(...)
  #endif
  
  using ll = long long;
  template <typename T>
  using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
  #define f first
  #define s second
  #define pb push_back
  #define all(v) v.begin(), v.end()
  auto TimeStart = chrono::steady_clock::now();
  auto seed = TimeStart.time_since_epoch().count();
  std::mt19937 rng(seed);
  template <typename T>
  using Random = std::uniform_int_distribution<T>;
  
  const int NAX = 2e5 + 5, MOD = 1000000007;
  
  int cost[10][10], costb[10][10];
  
  void solveCase(int caseNo)
  {
      // KHULJA
      int n, m;
      string a, b;
      cin >> n >> m >> a >> b;
      for (int i = 0; i < 10; ++i)
      {
          cost[i][i] = 0;
          cin >> cost[i][(i + 1) % 10];
      }
      for (int i = 0; i < 10; ++i)
      {
          int curr = (i + 1) % 10;
          for (int j = 0; j < 9; ++j)
          {
              int next = (curr + 1) % 10;
              if (next == i)
                  break;
              cost[i][next] = cost[i][curr] + cost[curr][next];
              curr = next;
          }
      }
      // for (int i = 0; i < 10; ++i)
      // {
      //     for (int j = 0; j < 10; ++j)
      //         cout << cost[i][j] << ' ';
      //     cout << '\n';
      // }
      // cout << '\n';
      for (int i = 0; i < 10; ++i)
      {
          costb[i][i] = 0;
          cin >> costb[i][(i + 1) % 10];
      }
      for (int i = 0; i < 10; ++i)
      {
          int curr = (i + 1) % 10;
          for (int j = 0; j < 9; ++j)
          {
              int next = (curr + 1) % 10;
              if (next == i)
                  break;
              costb[i][next] = costb[i][curr] + costb[curr][next];
              curr = next;
          }
      }
      // for (int i = 0; i < 10; ++i)
      // {
      //     for (int j = 0; j < 10; ++j)
      //         cout << costb[i][j] << ' ';
      //     cout << '\n';
      // }
      
  }
  
  int main()
  {
  #ifndef LOCAL
      ios_base::sync_with_stdio(0);
      cin.tie(0);
  #endif
      int t = 1;
  #ifdef MULTI_TEST
      cin >> t;
  #endif
      for (int i = 1; i <= t; ++i)
      {
          solveCase(i);
  #ifdef TIME
          cerr << "Case #" << i << ": Time " << chrono::duration<double>(chrono::steady_clock::now() - TimeStart).count() << " s.\n";
          TimeStart = chrono::steady_clock::now();
  #endif
      }
      return 0;
  }