Example

Input

1+2*3+4
11


Output

M
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

int main() {
	string s;
	cin >> s;
	int ans;
	cin >> ans;
	int lr = s[0] - '0';
	REP(i, s.length() / 2){
		if (s[i * 2 + 1] == '+')
			lr += s[i * 2 + 2] - '0';
		else
			lr *= s[i * 2 + 2] - '0';
	}
	int mul = 0;
	vector<int> numbers;
	REP(i, s.length() / 2 + 1){
		numbers.push_back(s[i * 2] - '0');
	}
	REP(i, (s.length() / 2)){
		if (s[i * 2 + 1] == '*'){
			numbers[i + 1] *= numbers[i];
			numbers[i] = 0;
		}
	}
	REP(i, numbers.size()){
		mul += numbers[i];
	}
	if (lr == ans&&mul == ans)
		cout << "U" << endl;
	else if (lr == ans)
		cout << "L" << endl;
	else if (mul == ans)
		cout << "M" << endl;
	else
		cout << "I" << endl;
}