using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var h = ni();
        var w = ni();
        var s = ns(h);

        var adj = Enumerable.Range(0, w * h).Select(_ => new List<int>()).ToArray();
        int ToIndex(int row, int col) => row * w + col;
        int blackNum = 0;
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (s[i][j] == '.') {
                    if (i + 1 < h && s[i + 1][j] == '.') {
                        adj[ToIndex(i, j)].Add(ToIndex(i + 1, j));
                        adj[ToIndex(i + 1, j)].Add(ToIndex(i, j));
                    }
                    if (j + 1 < w && s[i][j + 1] == '.') {
                        adj[ToIndex(i, j)].Add(ToIndex(i, j + 1));
                        adj[ToIndex(i, j + 1)].Add(ToIndex(i, j));
                    }
                } else {
                    blackNum++;
                }
            }
        }
        var result = BFSUtil.BFS(adj, ToIndex(0, 0));
        var minCost = result.Distance[ToIndex(h - 1, w - 1)];
        if (minCost == null) {
            cout.WriteLine(-1);
        } else {
            cout.WriteLine(w * h - blackNum - minCost - 1);
        }
    }
}

public class BFSTreeInfo {
    public int[] Size;
    public int[] Parent;
    public int?[] Distance;
}

public static class BFSUtil {
    public static BFSTreeInfo BFS(List<int>[] adj, int root) {
        var n = adj.Length;
        var size = new int[n];
        var parents = new int[n];
        var distance = new int?[n];
        var visited = new bool[n];
        var queue = new Queue<int>();
        queue.Enqueue(root);
        queue.Enqueue(-1);
        var perm = new List<int>();
        while (queue.Count > 0) {
            var current = queue.Dequeue();
            var parent = queue.Dequeue();
            if (visited[current]) continue;
            visited[current] = true;
            parents[current] = parent;
            if (parent >= 0) distance[current] = (distance[parent] ?? 0) + 1;
            perm.Add(current);
            foreach (var next in adj[current]) {
                if (next == parent) continue;
                if (visited[next]) continue;
                queue.Enqueue(next);
                queue.Enqueue(current);
            }
        }
        perm.Reverse();
        foreach (var p in perm) {
            size[p] = 1;
            foreach (var next in adj[p]) {
                if (next == parents[p]) continue;
                size[p] += size[next];
            }
        }

        return new BFSTreeInfo {
            Size = size,
            Parent = parents,
            Distance = distance,
        };
    }

    public static int GetParent(this BFSTreeInfo[] t, int node, int root) {
        return t[root].Parent[node];
    }
    public static int GetSize(this BFSTreeInfo[] t, int node, int root) {
        return t[root].Size[node];
    }

}
// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}

Measured memory_bytes: 19148