You have an array of logs. Each log is a space delimited string of words.

In an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.

We are given two sentences A and B. (A sentence is a string of space separated words. Each word consists only of lowercase letters.)

Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length.